Article

X-means: Extending K-means with Efficient Estimation of the Number of Clusters

Authors:

Dan Pelleg,

Andrew W. MooreAuthors Info & Claims

ICML '00: Proceedings of the Seventeenth International Conference on Machine Learning

Pages 727 - 734

Published: 29 June 2000 Publication History

Abstract

No abstract available.

Cited By

View all

Liu JWang YZhang TFan YYang QShao JElkind E(2023)Open-world semi-supervised novel class discoveryProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/445(4002-4010)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/445
Zhang JWang YChang WLi WJiang JHsieh CYu HFrommholz IHopfgartner FLee MOakes MLalmas MZhang MSantos R(2023)Build Faster with Less: A Journey to Accelerate Sparse Model Building for Semantic Matching in Product SearchProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614661(4960-4966)Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1145/3583780.3614661
Kim MKim YJeong HHeo JKim SChung HLee ERoychoudhury ACadar CKim M(2022)An empirical study of deep transfer learning-based program repair for Kotlin projectsProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3558967(1441-1452)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3558967
Show More Cited By

Index Terms

X-means: Extending K-means with Efficient Estimation of the Number of Clusters
1. Computing methodologies
  1. Machine learning
    1. Learning paradigms
      1. Supervised learning
        Supervised learning by classification
      2. Unsupervised learning
        Cluster analysis
    2. Machine learning approaches
      1. Classification and regression trees

Recommendations

Hybrid Bisect K-Means Clustering Algorithm
BCGIN '11: Proceedings of the 2011 International Conference on Business Computing and Global Informatization

In this paper, we present a hybrid clustering algorithm that combines divisive and agglomerative hierarchical clustering algorithm. Our method uses bisect K-means for divisive clustering algorithm and Unweighted Pair Group Method with Arithmetic Mean (...
DIC-DOC-K-means: Dissimilarity-based Initial Centroid selection for DOCument clustering using K-means for improving the effectiveness of text document clustering

In this article, a new initial centroid selection for a K-means document clustering algorithm, namely, Dissimilarity-based Initial Centroid selection for DOCument clustering using K-means (DIC-DOC-K-means), to improve the performance of text document ...
RK-Means Clustering: K-Means with Reliability

This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the ...

Comments

Information & Contributors

Information

Published In

ICML '00: Proceedings of the Seventeenth International Conference on Machine Learning

June 2000

1208 pages

ISBN:1558607072

Editor:
Pat Langley

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 29 June 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

324
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu JWang YZhang TFan YYang QShao JElkind E(2023)Open-world semi-supervised novel class discoveryProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/445(4002-4010)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/445
Zhang JWang YChang WLi WJiang JHsieh CYu HFrommholz IHopfgartner FLee MOakes MLalmas MZhang MSantos R(2023)Build Faster with Less: A Journey to Accelerate Sparse Model Building for Semantic Matching in Product SearchProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614661(4960-4966)Online publication date: 21-Oct-2023
https://dl.acm.org/doi/10.1145/3583780.3614661
Kim MKim YJeong HHeo JKim SChung HLee ERoychoudhury ACadar CKim M(2022)An empirical study of deep transfer learning-based program repair for Kotlin projectsProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3558967(1441-1452)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3558967
Stevens CBagheri HRoychoudhury ACadar CKim M(2022)Parasol: efficient parallel synthesis of large model spacesProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3549157(620-632)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3549157
Li YYang MPeng DLi THuang JPeng X(2022)Twin Contrastive Learning for Online ClusteringInternational Journal of Computer Vision10.1007/s11263-022-01639-z130:9(2205-2221)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.1007/s11263-022-01639-z
Calikus ENowaczyk SBouguelia MDikmen O(2022)Wisdom of the contexts: active ensemble learning for contextual anomaly detectionData Mining and Knowledge Discovery10.1007/s10618-022-00868-736:6(2410-2458)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s10618-022-00868-7
Mariescu-Istodor RCristian ANegrea MCao P(2021)VRPDiv: A Divide and Conquer Framework for Large Vehicle Routing ProblemsACM Transactions on Spatial Algorithms and Systems10.1145/34748327:4(1-41)Online publication date: 3-Sep-2021
https://dl.acm.org/doi/10.1145/3474832
Cheng LAhmed SLiljestrand HNyman TCai HJaeger TAsokan NYao D(2021)Exploitation Techniques for Data-oriented Attacks with Existing and Potential Defense ApproachesACM Transactions on Privacy and Security10.1145/346269924:4(1-36)Online publication date: 2-Sep-2021
https://dl.acm.org/doi/10.1145/3462699
Dumani LWiesenfeldt TSchenkel RDemartini GZuccon GCulpepper JHuang ZTong H(2021)Fine and Coarse Granular Argument Classification before ClusteringProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482431(422-432)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482431
Leiber CBauer LSchelling BBöhm CPlant CZhu FChin Ooi BMiao CWang HSkrypnyk IHsu WChawla S(2021)Dip-based Deep Embedded Clustering with k-EstimationProceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining10.1145/3447548.3467316(903-913)Online publication date: 14-Aug-2021
https://dl.acm.org/doi/10.1145/3447548.3467316
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Hybrid Bisect K-Means Clustering Algorithm

DIC-DOC-K-means: Dissimilarity-based Initial Centroid selection for DOCument clustering using K-means for improving the effectiveness of text document clustering

RK-Means Clustering: K-Means with Reliability

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations