A neighborhood-based approach for clustering of linked document collections

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2006, Pages 778-779

  Angelova, Ralitsa ^a   Siersdorfer, Stefan ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Clustering; Exploiting link structure

Indexed keywords

BIBLIOGRAPHIC RETRIEVAL SYSTEMS; DATA ACQUISITION; DATA STRUCTURES; ITERATIVE METHODS; PROBLEM SOLVING; WEB SERVICES; WEBSITES;

BIBLIOGRAPHIC DATA ENTRIES; CLUSTERING; EXPLOITING LINK STRUCTURES;

CLUSTERING ALGORITHMS;

EID: 34547638416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183726     Document Type: Conference Paper

References (7)

1. R. Angelova, S. Sieradorfer, and G. Weikum. A neighborhoodbased approach for clustering of linked document collections. Research Report MPI-I-2006-5-005, 2006.
2. R. Angelova and G. Weikum. Graph-based text classification: Learn from your neighbors. In .ACM SIGIR '06, 2006.
3. J. Hartigan and M. Wong. A k-means clustering algorithm. Applied Statistics, 28:100-108, 1979.
4. S. Z. Li. Markov random field modeling in image analysis. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2001.
5. L. Pelkowitz. A continuous relaxation labeling algorithm for markov random fields. 20:709-715, 1990.
6. A. Schenker, H. Bunke, M. Last, and A. Kandel. Graph-theoretic techniques for web content mining. Series in Machine Perception and Artificial Intelligence, 62, 2005.
7. C. Zahn. Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Trans. Comp., C20:68-86, 1971.