A new kernel for classification of networked entities
2008
"Statistical machine learning techniques for data classi cation usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities often interconnect with each other through explicit or implicit relationships to form a complex network. Although some graph-based classification methods have emerged in recent years, they are not really suitable for complex networks as they do not take the degree
distribution of network into consideration. In this paper, we propose a new technique, Modularity Kernel, that can effectively exploit the latent community structure of networked entities for their classi cation. A number of experiments on hypertext datasets show that our proposed approach leads to excellent classification performance in comparison with the state-of-the-art methods."
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
10
References
9
Citations
NaN
KQI