On the public citation graph
K-Separability
0 signed · 41 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/978-3-540-24844-6_5openalex-snapshot
Visualization of Hidden Node Activity in Neural Networks: I. Visualization Methods
inferredcites →https://doi.org/10.1007/978-3-540-24844-6_6openalex-snapshot
Visualization of Hidden Node Activity in Neural Networks: II. Application to RBF Networks
inferredcites →https://doi.org/10.1007/b98109openalex-snapshot
Artificial intelligence and soft computing - ICAISC 2004 : 7th International Conference, Zakopane, Poland, June 7-11, 2004 : proceedings
inferredcites →https://doi.org/10.1016/c2009-0-19715-5openalex-snapshot
Data Mining: Practical Machine Learning Tools and Techniques
inferredcites →https://doi.org/10.1016/s0893-6080(00)00038-1openalex-snapshot
On the exact solution of the Parity-N problem using ordered neural networks
inferredcites →https://doi.org/10.1016/s0893-6080(05)80088-7openalex-snapshot
How to solve the N-bit parity problem with two hidden units
inferredcites →https://doi.org/10.1016/s0893-6080(05)80114-5openalex-snapshot
Parity with two layer feedforward nets
inferredcites →https://doi.org/10.1016/s0925-2312(01)00612-9openalex-snapshot
N-bit parity neural networks: new solutions based on linear programming
inferredcites →https://doi.org/10.1016/s0925-2312(02)00610-0openalex-snapshot
N-bit parity ordered neural networks
inferredcites →https://doi.org/10.1016/s0925-2312(97)00030-1openalex-snapshot
On the solution of the parity problem by a single hidden layer feedforward neural network
inferredcites →https://doi.org/10.1023/a:1021726007566openalex-snapshot
The Minimum Number of Errors in the N-Parity and its Solution with an Incremental Neural Network
inferredcites →https://doi.org/10.1023/b:nepl.0000011147.74207.8copenalex-snapshot
A Solution for the N-bit Parity Problem Using a Single Translated Multiplicative Neuron
inferredcites →https://doi.org/10.1109/72.914524openalex-snapshot
A new methodology of extraction, optimization and application of crisp and fuzzy logical rules
inferredcites →https://doi.org/10.1109/ijcnn.2000.861353openalex-snapshot
Taxonomy of neural transfer functions
inferredcites →https://doi.org/10.1109/ijcnn.2001.1016713openalex-snapshot
International Joint Conference on Neural Networks
inferredcites →https://doi.org/10.1109/ijcnn.2003.1223669openalex-snapshot
Coloring black boxes: visualization of neural network decisions
inferredcites →https://doi.org/10.1109/ijcnn.2003.1223966openalex-snapshot
Solving parity-N problems with feedforward neural networks
inferredcites →https://doi.org/10.1109/ijcnn.2005.1556089openalex-snapshot
A combined SVM and LDA approach for classification
inferredcites →https://doi.org/10.1109/tnn.2003.810598openalex-snapshot
On the number of multilinear partitions and the computing capacity of multiple-valued multiple-threshold perceptrons
inferredcites →https://doi.org/10.1613/jair.105openalex-snapshot
Solving Multiclass Learning Problems via Error-Correcting Output Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-69731-2_55openalex-snapshot
A Comparison of Methods for Learning of Highly Non-separable Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-71984-7_11openalex-snapshot
Towards Comprehensive Foundations of Computational Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-540-74690-4_19openalex-snapshot
Learning Highly Non-separable Boolean Functions Using Constructive Feedforward Neural Network
inferred← citeshttps://doi.org/10.1007/978-3-540-87536-9_36openalex-snapshot
Support Vector Machines for Visualization and Dimensionality Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-87559-8_78openalex-snapshot
Projection Pursuit Constructive Neural Networks Based on Quality of Projected Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-04274-4_16openalex-snapshot
Constrained Learning Vector Quantization or Relaxed k-Separability
inferred← citeshttps://doi.org/10.1007/978-3-642-04274-4_81openalex-snapshot
Almost Random Projection Machine
inferred← citeshttps://doi.org/10.1007/978-3-642-04512-7_3openalex-snapshot
Constructive Neural Network Algorithms That Solve Highly Non-separable Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-05179-1_22openalex-snapshot
Discovering Data Structures Using Meta-learning, Visualization and Constructive Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-10684-2_23openalex-snapshot
Universal Learning Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-13529-3_20openalex-snapshot
Support Feature Machine for DNA Microarray Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15822-3_5openalex-snapshot
Almost Random Projection Machine with Margin Maximization and Kernel Features
inferred← citeshttps://doi.org/10.1007/978-3-642-15825-4_25openalex-snapshot
An Efficient Collaborative Recommender System Based on k-Separability
inferred← citeshttps://doi.org/10.1007/978-3-642-20267-4_10openalex-snapshot
Fast Projection Pursuit Based on Quality of Projected Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-20980-2_10openalex-snapshot
Optimal Support Features for Meta-Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-29347-4_48openalex-snapshot
Locally Optimized Kernels
inferred← citeshttps://doi.org/10.1007/s11432-011-4405-6openalex-snapshot
The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
inferred← citeshttps://doi.org/10.1109/ijcnn.2010.5596341openalex-snapshot
Support Feature Machines: Support vectors are not enough
inferred← citeshttps://doi.org/10.1109/soli.2009.5204027openalex-snapshot
Rule flow learning: A multiple linear classifier algorithm
inferred← citeshttps://doi.org/10.1142/s0218213012500017openalex-snapshot
APPLYING k-SEPARABILITY TO COLLABORATIVE RECOMMENDER SYSTEMS
inferred← citeshttps://doi.org/10.4208/jml.241114openalex-snapshot
Cluster-Based Classification with Neural ODEs via Control
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.