The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Information theoretic clustering
Abstract
Clustering is an important topic in pattern recognition. Since only the structure of the data dictates the grouping (unsupervised learning), information theory is an obvious criteria to establish the clustering rule. The paper describes a novel valley seeking clustering algorithm using an information theoretic measure to estimate the cost of partitioning the data set. The information theoretic criteria developed here evolved from a Renyi entropy estimator (A. Renyi, 1960) that was proposed recently and has been successfully applied to other machine learning applications (J.C. Principe et al., 2000). An improved version of the k-change algorithm is used in optimization because of the stepwise nature of the cost function and existence of local minima. Even when applied to nonlinearly separable data, the new algorithm performs well, and was able to find nonlinear boundaries between clusters. The algorithm is also applied to the segmentation of magnetic resonance imaging data (MRI) with very promising results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
On Measures of Entropy and Information
Rényi, A. (1961) · Project Euclid (Cornell University) · Cited by 4,031
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
A review on image segmentation techniques
Pal, N. R., & Pal, S. K. (1993) · Pattern Recognition · doi:10.1016/0031-3203(93)90135-j · Cited by 3,708
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Gray, R. M. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50011-5 · Cited by 2,845
Gordon, A. D., & Hartigan, J. A. (1976) · Journal of the American Statistical Association · doi:10.2307/2286880 · Cited by 2,569
A massively parallel architecture for a self-organizing neural pattern recognition machine
Carpenter, G. A., & Grossberg, S. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80014-2 · Cited by 2,525
Mathematical Theory of Communication
(2009) · Encyclopedia of Neuroscience · doi:10.1007/978-3-540-29678-2_3338 · Cited by 2,297
Haralick, R. M., & Shapiro, L. G. (1985) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(85)90153-7 · Cited by 2,253
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
A Mathematical Theory of Communications
Shannon, C. E. (1948) · Cited by 2,080
Bhattacharyya, A. (1943) · Medical Entomology and Zoology · Cited by 2,002
Grossberg, S. (1976) · Biological Cybernetics · doi:10.1007/bf00344744 · Cited by 1,909
Entropy and Information Theory
Gray, R. M. (2011) · Springer eBooks · doi:10.1007/978-1-4419-7970-4 · Cited by 1,803
Information Theory and Statistics.
Dwass, M., & Kullback, S. (1960) · The American Mathematical Monthly · doi:10.2307/2309734 · Cited by 1,537
ART 2: self-organization of stable category recognition codes for analog input patterns
Carpenter, G. A., & Grossberg, S. (1987) · Applied Optics · doi:10.1364/ao.26.004919 · Cited by 1,442
Feature Discovery by Competitive Learning*
Rumelhart, D. E., & Zipser, D. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_5 · Cited by 1,057
Review of MR image segmentation techniques using pattern recognition
Bezdek, J. C., Hall, L. O., & Clarke, L. P. (1993) · Medical Physics · doi:10.1118/1.597000 · Cited by 953
Information Theoretic Learning: Renyi's Entropy and Kernel Perspectives
Principe, J. C. (2010) · Information Science and Statistics · doi:10.1007/978-1-4419-1570-2 · Cited by 939
Self-citationFeature discovery by competitive learning
RUMELHART, D., & ZIPSER, D. (1985) · Cognitive Science · doi:10.1016/s0364-0213(85)80010-0 · Cited by 882
Entropy optimization principles with applications
Kapur, J. N., & Kesavan, H. K. (1992) · Medical Entomology and Zoology · Cited by 858
Brain development, gender and IQ in children: A volumetric imaging study
Reiss, A. L., Abrams, M. T., Singer, H. S., Ross, J. L., & Denckla, M. B. (1996) · Brain · doi:10.1093/brain/119.5.1763 · Cited by 844
Entropy and Information Theory
Gray, R. M. (1990) · Springer eBooks · doi:10.1007/978-1-4757-3982-4 · Cited by 660
Entropy Optimization Principles and Their Applications
Kapur, J. N., & Kesavan, H. K. (1992) · Water Science and Technology Library · doi:10.1007/978-94-011-2430-0_1 · Cited by 509
Information Theoretic Learning
Erdogmus, D., & Principe, J. C. (2009) · Encyclopedia of Artificial Intelligence · doi:10.4018/978-1-59904-849-9.ch133 · Cited by 506
Self-citationEntropy optimization principles with applications
Lind, N. (1993) · Structural Safety · doi:10.1016/0167-4730(93)90006-m · Cited by 493
Pattern Recognition: Human and Mechanical
Watanabé, S. (1985) · Cited by 487
Review of Neural Networks for Speech Recognition
Lippmann, R. P. (1989) · Neural Computation · doi:10.1162/neco.1989.1.1.1 · Cited by 477
Pairwise data clustering by deterministic annealing
Hofmann, T., & Buhmann, J. M. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.566806 · Cited by 451
Neural and Adaptive Systems: Fundamentals Through Simulations
Chen, K., Kvasnicka, V., Kanen, P. C., & Haykin, S. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2001.925574 · Cited by 416
Mixture Models: Inference and Applications to Clustering.
Hand, D. J., McLachlan, G. J., & Basford, K. E. (1989) · Applied Statistics · doi:10.2307/2348072 · Cited by 392
Incremental clustering and dynamic information retrieval
Charikar, M., Chekuri, C., Feder, T., & Motwani, R. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258657 · Cited by 354
On the structure of vector quantizers
Gersho, A. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056457 · Cited by 317
Bayesian approaches to Gaussian mixture modeling
Roberts, S. J., Husmeier, D., Rezek, I., & Penny, W. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.730550 · Cited by 317
The EM Algorithm and Extensions.
Gentle, J. E., McLachlan, G. J., & Krishnan, T. (1998) · Biometrics · doi:10.2307/2534032 · Cited by 242
Jack, C. R., Bentley, M. D., Twomey, C. K., & Zinsmeister, A. R. (1990) · Radiology · doi:10.1148/radiology.176.1.2353093 · Cited by 197
Neural and Adaptive Systems: Fundamentals through Simulations with CD-ROM
Príncipe, J. C., Euliano, N. R., & Lefebvre, W. (1999) · John Wiley & Sons, Inc. eBooks · Cited by 173
Computerized Volume Measurement of Brain Structure
Ashtari, M., Zito, J. L., GOLD, B. I., Lieberman, J. A., Borenstein, M., & Herman, P. G. (1990) · Investigative Radiology · doi:10.1097/00004424-199007000-00009 · Cited by 86
Accuracy and Reproducibility in Volumetric Analysis of Multiple Sclerosis Lesions
Jackson, E. F., Narayana, P. A., Wolinsky, J. S., & Doyle, T. J. (1993) · Journal of Computer Assisted Tomography · doi:10.1097/00004728-199303000-00007 · Cited by 79
An approach to speaker identification using multiple classifiers
Radová, V., & Psutka, J. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1997.596142 · Cited by 27
Learning from examples with quadratic mutual information
Xu, D., & Príncipe, J. C. (2002) · Machine learning for signal processing ... · doi:10.1109/nnsp.1998.710645 · Cited by 25
Data clustering with entropical scheduling
Shimoji, S., & Lee, S. (2002) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1994.374600 · Cited by 11
Large scale hand-written character recognition system using subspace method
Kato, N., & NEMOTO, Y. (2002) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.1996.569812 · Cited by 5
Cited by
(2012) · MPG.PuRe (Max Planck Society) · doi:10.5555/2188385.2188410 · Cited by 3,603
A Kernel Method for the Two-Sample-Problem
Gretton, A., Borgwardt, K. M., Rasch, M., Schölkopf, B., & Smola, A. J. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0069 · Cited by 2,167
Combining multiple clusterings using evidence accumulation
Fred, A. L. N., & Jain, A. K. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.113 · Cited by 1,195
Finding the Number of Clusters in a Dataset: An Information-Theoretic Approach
Sugar, C. A., & James, G. M. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503000000666 · Cited by 811
Received-Signal-Strength-Based Indoor Positioning Using Compressive Sensing
Feng, C., Au, W. S. A., Valaee, S., & Tan, Z. (2012) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2011.216 · Cited by 589
Metadata
- Authors
- Gokcay, E., & Principe, J. C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002
- Volume
- 24
- Issue
- 2
- Pages
- 158-171
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2019359195
- Cited by
- 293
- References
- 57
- FWCI
- 15.39
- 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.