The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
CLUTO - A Clustering Toolkit
Open accessAbstract
Clustering algorithms divide data into meaningful or useful groups, called clusters, such that the intra-cluster similarity is maximized and the inter-cluster similarity is minimized. These discovered clusters can be used to explain the characteristics of the underlying data distribution andthus serve as the foundation for various data mining and analysis techniques. The applications of clustering include characterization of different customer groups based upon purchasing patterns, categorization of documents onthe World Wide Web, grouping of genes and proteins that have similar functionality, grouping of spatial locations prone to earth quakes from seismological data, etc. CLUTO is a software package for clustering low and high dimensional datasets and for analyzing the characteristics of the various clusters. CLUTO provides three different classes of clustering algorithms thatoperate either directly in the object's feature space or in the object'ssimilarity space. These algorithms are based on the partitional, agglomerative, and graph-partitioning paradigms. A key feature in most of CLUTO's clustering algorithms is that they treat the clustering problem as an optimization process which seeks to maximize or minimizea particular clustering criterion function defined either globally or locally over the entire clustering solution space. CLUTO provides a total of seven different criterion functions that can be used to drive both partitional and agglomerative clustering algorithms. Most of these criterion functions have been shown to produce high qualityclustering solutions in high dimensional datasets, especially those arising in document clustering. In addition to these criterion functions, CLUTO providessome of the more traditional local criteria (e.g., single-link, complete-link, and UPGMA) that can be used in the context of agglomerative clustering. Furthermore, CLUTO provides graph-partitioning-based clustering algorithms that are well-suited for finding clusters that form contiguous regions that span different dimensions of the underlying feature space. CLUTO's distribution consists of both stand-alone programs for clustering and analyzing these clusters, as well as, a library via which anapplication program can access directly the various clustering and analysis algorithms implemented in CLUTO.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Criterion Functions for Document Clustering: Experiments and Analysis
Zhao, Y., & Karypis, G. (2001) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 581
Self-citation
Cited by
Baroni, M., Dinu, G., & Kruszewski, G. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1023 · Cited by 1,364
Multimodal Distributional Semantics
Bruni, E., Tran, N. K., & Baroni, M. (2014) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4135 · Cited by 908
Distributional Memory: A General Framework for Corpus-Based Semantics
Baroni, M., & Lenci, A. (2010) · Computational Linguistics · doi:10.1162/coli_a_00016 · Cited by 659
Hierarchical Clustering Algorithms for Document Datasets
Zhao, Y., Karypis, G., & Fayyad, U. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0361-3 · Cited by 627
Self-citationHierarchical Document Clustering Using Frequent Itemsets
Fung, B. C. M., Wang, K., & Ester, M. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.6 · Cited by 471
Using Hashtags to Capture Fine Emotion Categories from Tweets
Mohammad, S. M., & Kiritchenko, S. (2015) · Computational Intelligence · doi:10.1111/coin.12024 · Cited by 408
Frequent substructure-based approaches for classifying chemical compounds
Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.127 · Cited by 371
Self-citationQuantifying controversy on social media
Garimella, K., Morales, G. D. F., Gionis, A., & Mathioudakis, M. (2018) · ACM Transactions on Social Computing · doi:10.1145/3140565 · Cited by 472
Bullinaria, J. A., & Levy, J. P. (2012) · Behavior Research Methods · doi:10.3758/s13428-011-0183-8 · Cited by 303
Hornik, K., Feinerer, I., Kober, M., & Buchta, C. (2012) · Journal of Statistical Software · doi:10.18637/jss.v050.i10 · Cited by 275
Quantifying Controversy in Social Media
Garimella, K., De Francisci Morales, G., Gionis, A., & Mathioudakis, M. (2016) · Proceedings of the Ninth ACM International Conference on Web Search and Data Mining · doi:10.1145/2835776.2835792 · Cited by 147
“in the whole topic, after standard preprocessing used in IR (lowercasing, stopword removal, stemming). Following the lines of our main pipeline, we group these vectors in two clusters by using CLUTO [Karypis 2002] with cosine distance. The underlying assumption is that the two sides, while sharing the use of the hasht…”
Method8. Spoken Dialogue Interfaces for Older People
Ravichander, V., Maria, W., & Steve, R. (2012) · Assistive Technology Research Series · doi:10.3233/978-1-61499-127-4-118 · Cited by 15
Quantifying Controversy in Social Media
Garimella, K., Morales, G. D. F., Gionis, A., & Mathioudakis, M. (2015) · arXiv · Cited by 7
Metadata
- Authors
- Karypis, G.
- Publisher
- Defense Technical Information Center
- Published
- 2002-04-23
- OpenAlex
- W113396932
- Cited by
- 546
- References
- 1
- Type
- report
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.