Comparison of distance measures for graph-based clustering of documents

DOI10.1007/3-540-45028-9_18MaRDI QIDQ4450805zbMATH OpenFDO

Authors Adam Schenker, Mark Last, A. Kandel, Horst Bunke

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2726/27260202.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• Structural, Syntactic, and Statistical Pattern Recognition
• Advances in Artificial Intelligence
• Empirical and theoretical comparisons of selected criterion functions for document clustering
• Empirical and theoretical comparisons of selected criterion functions for document clustering
• Comparing clusterings -- an information based distance
• Approximate greedy clustering and distance selection for graph metrics

Cited in

(9)

• Developing a new similarity measure from two different perspectives
• Centrality measures for text clustering
• Engineering Comparators for Graph Clusterings
• scientific article; zbMATH DE number 1855630 (Why is no real title available?)
• Graph-Theoretic Techniques for Web Content Mining
• Structural, Syntactic, and Statistical Pattern Recognition
• Co-clustering documents and words by minimizing the normalized cut objective function
• A novel approach for clustering sentiments in Chinese blogs based on graph similarity
• Matching graphs with unique node labels

This page was built for publication: Comparison of distance measures for graph-based clustering of documents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450805)