Extracting community structure features for hypertext classification


Standard text classification techniques assume that all documents are independent and identically distributed (i.i.d.). However, hypertext documents such as Web pages are interconnected with links. How to take advantage of such links as extra evidences to enhance automatic classification of hypertext documents is a non-trivial problem. We think a collection of interconnected hypertext documents can be considered as a complex network, and the underlying community structure of such a document network contains valuable clues about the right classification of documents. This paper introduces a new technique, modularity Eigenmap, that can effectively extract community structure features from the document network which is induced from document link information only or constructed by combining both document content and document link information. A number of experiments on real-world benchmark datasets show that the proposed approach leads to excellent classification performance in comparison with the state-of-the-art methods.

DOI: 10.1109/ICDIM.2008.4746816

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@article{Zhang2008ExtractingCS, title={Extracting community structure features for hypertext classification}, author={Dell Zhang and Robert Mao}, journal={2008 Third International Conference on Digital Information Management}, year={2008}, pages={436-441} }