Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Random embedding machines for pattern recognition.

Y Baram1

  • 1Department of Computer Science, Technion, Israel Institute of Technology, Haifa 32000, Israel.

Neural Computation
|October 25, 2001
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Effects of cisplatin on olfactory function in cancer patients.

British journal of cancer·2005
Same author

Manifold stochastic dynamics for Bayesian learning.

Neural computation·2001
Same author

Multidimensional density shaping by sigmoids.

IEEE transactions on neural networks·1996
Same author

[Primary CNS lymphoma--new aspects in diagnosis and treatment].

Harefuah·1995
Same author

High-capacity Hebbian storage by sparse sampling.

IEEE transactions on neural networks·1995
Same author

Second-order bounds on the domain of attraction and the rate of convergence of nonlinear dynamical systems and neural networks.

IEEE transactions on neural networks·1994
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

This study introduces a novel method for data classification, enhancing linear separability for clustered data through random surface embedding. The approach significantly reduces computational complexity and learning time compared to existing techniques.

Area of Science:

  • Machine Learning
  • Data Science
  • Computational Mathematics

Background:

  • Real-world classification tasks often involve complex, structured data.
  • Existing methods struggle with high-dimensional or non-linearly separable data.
  • The challenge of efficiently clustering and separating data remains significant.

Purpose of the Study:

  • To develop a method for achieving linear separability in clustered data.
  • To reduce the complexity of machine learning classification problems.
  • To resolve questions regarding the complexity of random embedding techniques.

Main Methods:

  • Embedding data points in binary space using randomly parameterized surfaces.
  • Utilizing a local clustering condition to ensure data separability.

Related Experiment Videos

  • Implementing a voting system with embedding hyperplanes for data reduction.
  • Employing a two-internal-layer network for multicluster data separation.

    • Main Results:

    • Demonstrated arbitrary high probability of linear separability for local relative clusters.
    • Showcased an inverse proportionality between embedding set size and local clustering degree.
    • Developed a method that reduces the nearest-neighbor approach.
    • Achieved performance comparable to state-of-the-art methods with significantly reduced computation time.

    Conclusions:

    • The proposed random embedding method effectively achieves linear separability for clustered data.
    • This technique offers a substantial reduction in learning problem complexity.
    • The method is computationally efficient and performs competitively with existing advanced techniques.