On the public citation graph
Progressive Feature Extraction with a Greedy Network-growing Algorithm
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02312392openalex-snapshot
Fast learning with incremental RBF networks
inferredcites →https://doi.org/10.1016/0893-6080(90)90071-ropenalex-snapshot
Competitive learning algorithms for vector quantization
inferredcites →https://doi.org/10.1016/0893-6080(94)90091-4openalex-snapshot
Growing cell structures—A self-organizing network for unsupervised and supervised learning
inferredcites →https://doi.org/10.1080/09540090110047767openalex-snapshot
Knowledge-based cascade-correlation: Using knowledge to speed learning
inferredcites →https://doi.org/10.1080/0954898x.1996.11978653openalex-snapshot
Mutual information maximization: models of cortical self-organization
inferredcites →https://doi.org/10.1093/bioinformatics/17.2.126openalex-snapshot
A hierarchical unsupervised growing neural network for clustering gene expression patterns
inferredcites →https://doi.org/10.1109/2.36openalex-snapshot
Self-organization in a perceptual network
inferredcites →https://doi.org/10.1109/ijcnn.1991.155390openalex-snapshot
Unsupervised clustering with growing cell structures
inferredcites →https://doi.org/10.1111/j.1551-6708.1987.tb00862.xopenalex-snapshot
Competitive Learning: From Interactive Activation to Adaptive Resonance
inferredcites →https://doi.org/10.1162/neco.1993.5.2.267openalex-snapshot
Learning Mixture Models of Spatial Coherence
inferredcites →https://doi.org/10.1184/r1/6610403openalex-snapshot
The Cascade-Correlation learning architecture
inferredcites →https://doi.org/10.7551/mitpress/5236.003.0008openalex-snapshot
On Learning the Past Tenses of English Verbs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11550907_35openalex-snapshot
Maximizing the Ratio of Information to Its Cost in Information Theoretic Competitive Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-30499-9_100openalex-snapshot
Cost-Sensitive Greedy Network-Growing Algorithm with Gaussian Activation Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-30499-9_80openalex-snapshot
One-Epoch Learning for Supervised Information-Theoretic Competitive Learning
inferred← citeshttps://doi.org/10.1007/s00422-011-0434-xopenalex-snapshot
Self-enhancement learning: target-creating learning and its application to self-organizing maps
inferred← citeshttps://doi.org/10.1007/s00521-011-0785-1openalex-snapshot
Repeated comprehensibility maximization in competitive learning
inferred← citeshttps://doi.org/10.1007/s11063-009-9109-1openalex-snapshot
Enhancing and Relaxing Competitive Units for Feature Discovery
inferred← citeshttps://doi.org/10.1016/j.neucom.2008.09.013openalex-snapshot
An information-theoretic approach to feature extraction in competitive learning
inferred← citeshttps://doi.org/10.1016/j.neucom.2010.05.013openalex-snapshot
Information-theoretic enhancement learning and its application to visualization of self-organizing maps
inferred← citeshttps://doi.org/10.1016/j.neucom.2010.12.002openalex-snapshot
Supposed maximum information for comprehensible representations in SOM
inferred← citeshttps://doi.org/10.1016/j.neucom.2011.09.031openalex-snapshot
Relative information maximization and its application to the extraction of explicit class structure in SOM
inferred← citeshttps://doi.org/10.1016/j.neunet.2005.06.017openalex-snapshot
Unifying cost and information in information-theoretic competitive learning
inferred← citeshttps://doi.org/10.1023/b:nepl.0000011136.78760.22openalex-snapshot
Information-Theoretic Competitive Learning with Inverse Euclidean Distance Output Units
inferred← citeshttps://doi.org/10.1080/03081070500065759openalex-snapshot
Improving information-theoretic competitive learning by accentuated information maximization
inferred← citeshttps://doi.org/10.1080/03081070600913684openalex-snapshot
Greedy network-growing algorithm with Minkowski distances
inferred← citeshttps://doi.org/10.1080/03081071003601421openalex-snapshot
Information enhancement for interpreting competitive learning
inferred← citeshttps://doi.org/10.1080/03081079.2010.549486openalex-snapshot
Constrained information maximization by free energy minimization
inferred← citeshttps://doi.org/10.1080/03081079.2011.643471openalex-snapshot
Comprehensibility maximization and humanly comprehensible representations
inferred← citeshttps://doi.org/10.1080/09540090310001611136openalex-snapshot
Teacher-directed learning: information-theoretic competitive learning in supervised multi-layered networks
inferred← citeshttps://doi.org/10.1080/09540090410001712674openalex-snapshot
Improving feature extraction performance of greedy network-growing algorithm by inverse euclidean distance
inferred← citeshttps://doi.org/10.1109/iccis.2004.1460390openalex-snapshot
Modular structure generation by greedy network-growing algorithm
inferred← citeshttps://doi.org/10.1109/iccis.2004.1460391openalex-snapshot
Accelerated greedy network-growing algorithm by Gaussian activation functions
inferred← citeshttps://doi.org/10.1109/icsmc.2008.4811552openalex-snapshot
Interpreting and improving multi-layered networks by free energy-based competitive learning
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346128openalex-snapshot
Self-supervised learning by information enhancement: Target-generating and spontaneous learning for competitive learning
inferred← citeshttps://doi.org/10.1109/ijcnn.2003.1223402openalex-snapshot
Faithful feature extraction by greedy network-growing algorithm
inferred← citeshttps://doi.org/10.1109/ijcnn.2003.1224000openalex-snapshot
Flexible self-organizing maps by information maximization
inferred← citeshttps://doi.org/10.1109/ijcnn.2004.1381106openalex-snapshot
Teacher-directed information maximization: supervised information-theoretic competitive learning with Gaussian activation functions
inferred← citeshttps://doi.org/10.1109/ijcnn.2004.1381107openalex-snapshot
Greedy network-growing by Minkowski distance functions
inferred← citeshttps://doi.org/10.1109/ijcnn.2007.4371225openalex-snapshot
Controlled Competitive Learning: Extending Competitive Learning to Supervised Learning
inferred← citeshttps://doi.org/10.1109/ijcnn.2007.4371227openalex-snapshot
Forced Information Maximization to Accelerate Information-Theoretic Competitive Learning
inferred← citeshttps://doi.org/10.1109/ijcnn.2008.4634083openalex-snapshot
Conditional information and information loss for flexible feature extraction
inferred← citeshttps://doi.org/10.1109/ijcnn.2015.7280541openalex-snapshot
Selective potentiality maximization for input neuron selection in self-organizing maps
inferred← citeshttps://doi.org/10.1109/iwcia.2015.7449455openalex-snapshot
Pseudo-potentiality maximization for improved interpretation and generalization in neural networks
inferred← citeshttps://doi.org/10.1109/smc.2015.285openalex-snapshot
Self-Organized Mutual Information Maximization Learning for Improved Generalization Performance
inferred← citeshttps://doi.org/10.1109/smc.2015.286openalex-snapshot
Self-Organizing Selective Potentiality Learning to Detect Important Input Neurons
inferred← citeshttps://doi.org/10.1515/jaiscr-2015-0026openalex-snapshot
Accumulative Information Enhancement In The Self-Organizing Maps And Its Application To The Analysis Of Mission Statements
inferred← citeshttps://doi.org/10.5772/13272openalex-snapshot
Information-Theoretic Approach to Interpret Internal Representations of Self-Organizing Maps
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.