ACM Home Page
Please provide us with feedback. Feedback
Soft clustering criterion functions for partitional document clustering: a summary of results
Full text PdfPdf (58 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the thirteenth ACM international conference on Information and knowledge management table of contents
Washington, D.C., USA
POSTER SESSION: Posters P-2 table of contents
Pages: 246 - 247  
Year of Publication: 2004
ISBN:1-58113-874-1
Authors
Ying Zhao  University of Minnesota, Minneapolis, MN
George Karypis  University of Minnesota and Army HPC Research Center, Minneapolis, MN
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 53,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1031171.1031225
What is a DOI?

ABSTRACT

Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster similarity, are very effective in producing hard clustering solutions for document datasets and outperform traditional partitional and agglomerative algorithms. In this paper we study the extent to which these criterion functions can be modified to include soft membership functions and whether or not the resulting soft clustering algorithms can further improve the clustering solutions. Specifically, we focus on four of these hard criterion functions, derive their soft-clustering extensions, and present an experimental evaluation involving twelve different datasets. Our results show that introducing softness into the criterion functions tends to lead to better clustering results for most datasets.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
E. Backer. Cluster Analysis by Optimal Decomposition of Induced Fuzzy Sets. Delft University Press, Delft, The Netherlands, 1978.
 
2
3
 
4
M. E. S. Mendes and L. Sacks. Evaluating fuzzy clustering for relevance-based information access. In Proc. of the IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2003, pages 648--653, May 2003.
 
5

Collaborative Colleagues:
Ying Zhao: colleagues
George Karypis: colleagues