The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
An incremental network for on-line unsupervised classification and topology learning
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Russell, E. L., Chiang, L. H., & Braatz, R. D. (2000) · Advances in Industrial Control · doi:10.1007/978-1-4471-0409-4_3 · Cited by 7,862
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
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
The global k-means clustering algorithm
Likas, A., Vlassis, N., & J. Verbeek, J. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(02)00060-2 · Cited by 3,733
Self-organized formation of topographically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · Cited by 2,995
Pattern Classification (2nd ed.)
Duda, R. O., Hart, P. E., & Stork, D. G. (1999) · Cited by 2,520
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
A Growing Neural Gas Network Learns Topologies
Fritzke, B. (1994) · Cited by 1,684
'Neural-gas' network for vector quantization and its application to time-series prediction
Martinetz, T. M., Berkovich, S. G., & Schulten, K. J. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238311 · Cited by 1,431
The ART of adaptive pattern recognition by a self-organizing neural network
Carpenter, G. A., & Grossberg, S. (1988) · Computer · doi:10.1109/2.33 · Cited by 1,287
Growing cell structures—A self-organizing network for unsupervised and supervised learning
Fritzke, B. (1994) · Neural Networks · doi:10.1016/0893-6080(94)90091-4 · Cited by 1,270
Topology representing networks
Martinetz, T., & Schulten, K. (1994) · Neural Networks · doi:10.1016/0893-6080(94)90109-0 · Cited by 883
An empirical comparison of four initialization methods for the K-Means algorithm
Peña, J. M., Lozano, J. A., & Larrañaga, P. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00069-0 · Cited by 866
How patterned neural connections can be set up by self-organization
Willshaw, D. J., & Von Der Malsburg, C. (1976) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1976.0087 · Cited by 822
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276312 · Cited by 669
(2005) · Interdisciplinary Mathematical Sciences · doi:10.1142/9789812701039_0003 · Cited by 611
Step-Wise Clustering Procedures
King, B. (1967) · Journal of the American Statistical Association · doi:10.1080/01621459.1967.10482890 · Cited by 386
Topology preservation in self-organizing feature maps: exact definition and measurement
Villmann, T., Der, R., Herrmann, M., & Martinetz, T. M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.557663 · Cited by 311
Competitive Hebbian Learning Rule Forms Perfectly Topology Preserving Maps
Martinetz, T. (1993) · ICANN ’93 · doi:10.1007/978-1-4471-2063-6_104 · Cited by 256 · cited 2×
“Martinetz and Schulten (1994) prove some theorems and reach the conclusion that the competitive Hebbian rule is suitable for forming a path preserving representations of a given manifold.”
BackgroundMethodCOMPETITIVE HEBBIAN LEARNING RULE FORMS PERFECTLY TOPOLOGY PRESERVING MAPS
Martinez, T. M. B. (1993) · Cited by 228
Patané, G., & Russo, M. (2001) · Neural Networks · doi:10.1016/s0893-6080(01)00104-6 · Cited by 221
A self-organizing network that can follow non-stationary distributions
Fritzke, B. (1997) · Lecture notes in computer science · doi:10.1007/bfb0020222 · Cited by 192
Life-long learning Cell Structures—continuously learning without catastrophic interference
Hamker, F. H. (2001) · Neural Networks · doi:10.1016/s0893-6080(01)00018-1 · Cited by 111
An Incremental Adaptive Network for On-line Supervised Learning and Probability Estimation
Lim, C. P., & Harrison, R. F. (1997) · Neural Networks · doi:10.1016/s0893-6080(96)00123-2 · Cited by 87
A robust and efficient clustering algorithm based on cohesion self-merging
Lin, C.-R., & Chen⋆, M.-S. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775133 · Cited by 23
Cited by
Reinforcement learning and adaptive dynamic programming for feedback control
Lewis, F. L., & Vrabie, D. (2009) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2009.933854 · Cited by 1,558
Zhang, H., Luo, Y., & Liu, D. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2027233 · Cited by 649
Research Review for Broad Learning System: Algorithms, Theory, and Applications
Gong, X., Zhang, T., Chen, C. L. P., & Liu, Z. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3061094 · Cited by 350
Clustering: A neural network approach
Du, K.-L. (2010) · Neural Networks · doi:10.1016/j.neunet.2009.08.007 · Cited by 325
Survey of State-of-the-Art Mixed Data Clustering Algorithms
Ahmad, A., & Khan, S. S. (2019) · IEEE Access · doi:10.1109/access.2019.2903568 · Cited by 253
Metadata
- Authors
- Furao, S., & Hasegawa, O.
- Venue
- Neural Networks
- Publisher
- Elsevier BV
- Published
- 2006-01
- Volume
- 19
- Issue
- 1
- Pages
- 90-106
- ISSN
- 0893-6080 (ISSN-L)
- OpenAlex
- W2120250216
- Cited by
- 315
- References
- 31
- FWCI
- 8.93
- 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.