Clustering by pattern similarity in large data sets
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of these models the concept of similarity is based on distances, e.g., Euclidean distance or cosine distance. In other words, similar objects are required to have close values on at least a set of dimensions. In this paper, we explore a more general type of similarity. Under the pCluster model we proposed, two objects are similar if they exhibit a coherent pattern on a subset of dimensions. For instance, in DNA microarray analysis, the expression levels of two genes may rise and fall synchronously in response to a set of environmental stimuli. Although the magnitude of their expression levels may not be close, the patterns they exhibit can be very much alike. Discovery of such clusters of genes is essential in revealing significant connections in gene regulatory networks. E-commerce applications, such as collaborative filtering, can also benefit from the new model, which captures not only the closeness of values of certain leading indicators but also the closeness of (purchasing, browsing, etc.) patterns exhibited by the customers. Our paper introduces an effective algorithm to detect such clusters, and we perform tests on several real and synthetic data sets to show its effectiveness.
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
(1996) · Cited by 20,179
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
Social information filtering: algorithms for automating “word of mouth”
Shardanand, U., & Maes, P. (1995) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '95 · doi:10.1145/223904.223931 · Cited by 2,823
Biclustering of expression data.
Cheng, Y., & Church, G. M. (2000) · PubMed · Cited by 2,462
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
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Cited by
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Biclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
Time-series clustering – A decade review
Aghabozorgi, S., Seyed Shirkhorshidi, A., & Ying Wah, T. (2015) · Information Systems · doi:10.1016/j.is.2015.04.007 · Cited by 1,826
“Clustering of time-series data is mostly utilized for discovery of interesting patterns in time-series datasets [27,28].”
BackgroundA review on time series data mining
Fu, T.-C. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2010.09.007 · Cited by 1,500
Frequent pattern mining: current status and future directions
Han, J., Cheng, H., Xin, D., & Yan, X. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-006-0059-1 · Cited by 1,380
A review of clustering techniques and developments
Saxena, A., Prasad, M., Gupta, A., Bharill, N., Patel, O. P., Tiwari, A., Er, M. J., Ding, W., & Lin, C.-T. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.06.053 · Cited by 1,357
Cluster analysis for gene expression data: a survey
Jiang, D., Tang, C., & Zhang, A. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.68 · Cited by 1,235
Kriegel, H.-P., Kröger, P., & Zimek, A. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1497577.1497578 · Cited by 1,093
Ezugwu, A. E., Ikotun, A. M., Oyelade, O. O., Abualigah, L., Agushaka, J. O., Eke, C. I., & Akinyelu, A. A. (2022) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.104743 · Cited by 924
A Comparison Study on Similarity and Dissimilarity Measures in Clustering Continuous Data
Shirkhorshidi, A. S., Aghabozorgi, S., & Wah, T. Y. (2015) · PLOS ONE · doi:10.1371/journal.pone.0144059 · Cited by 405
Clustering Algorithms in Biomedical Research: A Review
Xu, R., & Wunsch, D. C. (2010) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2010.2083647 · Cited by 349
FABIA: factor analysis for bicluster acquisition
Hochreiter, S., Bodenhofer, U., Heusel, M., Mayr, A., Mitterecker, A., Kasim, A., Khamiakova, T., Van Sanden, S., Lin, D., Talloen, W., et al. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq227 · Cited by 296
Busygin, S., Prokopyev, O., & Pardalos, P. M. (2008) · Computers & Operations Research · doi:10.1016/j.cor.2007.01.005 · Cited by 265
Biclustering on expression data: A review
Pontes, B., Giráldez, R., & Aguilar-Ruiz, J. S. (2015) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2015.06.028 · Cited by 256
TRICLUSTER: an effective algorithm for mining coherent clusters in 3D microarray data
Zhao, L., & Zaki, M. J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066236 · Cited by 209
“24], and pattern based clustering [7, 15, 26, 18, 5].”
BackgroundOP-cluster: clustering by tendency in high dimensional space
Liu, J., & Wang, W. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250919 · Cited by 199
“In light of this observation, the δ-pCluster model [17] was introduced to discover clusters by pattern similarity (rather than distance) from raw data sets.”
MethodSelf-citationBiclustering Methods: Biological Relevance and Application in Gene Expression Analysis
Oghabian, A., Kilpinen, S., Hautaniemi, S., & Czeizler, E. (2014) · PLoS ONE · doi:10.1371/journal.pone.0090801 · Cited by 88
“Another example is the method developed by Hartigan [16], and implemented in several algorithms later on [17,18].”
Method
Metadata
- Authors
- Wang, H., Wang, W., Yang, J., & Yu, P. S.
- Venue
- Proceedings of the 2002 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2002-06-03
- Pages
- 394-405
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W1983524036
- Cited by
- 484
- References
- 21
- FWCI
- 18.21
- Type
- conference paper
- 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.