Locally adaptive metrics for clustering high dimensional data
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Self-citationBottou, L., & Vapnik, V. (1992) · Neural Computation · doi:10.1162/neco.1992.4.6.888 · Cited by 542 · cited 1×
“The exponential weighting is more sensitive to changes in local feature relevance (Bottou and Vapnik 1992) and gives rise to better performance improvement.”
Background
Cited by
A Comprehensive Survey of Clustering Algorithms
Xu, D., & Tian, Y. (2015) · Annals of Data Science · doi:10.1007/s40745-015-0040-1 · Cited by 1,939
“There are mainly 4 kinds of methods to get the set of initial clustering results as follows: Table 16 Consensus functions Name Typical algorithm and application Based on co-association matrix [85] Based on graph partition CSPA, HGPA and MCLA [86] Based on relabeling and voting VM [88] Based on the hybrid model [89] Ba…”
MethodA SURVEY OF CLUSTERING ENSEMBLE ALGORITHMS
VEGA-PONS, S., & RUIZ-SHULCLOPER, J. (2011) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001411008683 · Cited by 609
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
The 2017 IEEE International Conference on Fuzzy Systems
(2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2016.2545826 · Cited by 308
Metadata
- Authors
- Domeniconi, C., Gunopulos, D., Ma, S., Yan, B., Al-Razgan, M., & Papadopoulos, D.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2007-01-26
- Volume
- 14
- Issue
- 1
- Pages
- 63-97
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2161985854
- Cited by
- 237
- References
- 2
- FWCI
- 22.06
- Type
- journal article
- Language
- en
- Open access
- closed
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.