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

Building k-connected neighborhood graphs for isometric data embedding.

Li Yang1

  • 1Department of Computer Science, Western Michigan University, Kalamazoo 49008, USA. li.yang@wmich.edu

IEEE Transactions on Pattern Analysis and Machine Intelligence
|April 28, 2006
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

Determination of total retronecine esters-type hepatotoxic pyrrolizidine alkaloids in plant materials by pre-column derivatization high-performance liquid chromatography.

Biomedical chromatography : BMC·2009
Same author

[Genetic structure of X-STR loci in Bai, Dai and Yi ethnic groups and their affinity with five major populations of China].

Yi chuan = Hereditas·2009
Same author

Suppression of lung cancer in murine model: treated by combination of recombinant human endostsatin adenovirus with low-dose cisplatin.

Journal of experimental & clinical cancer research : CR·2009
Same author

[Researches on cloning and expression of the gene encoding Schistosoma japonicum tetraspanins extracellular loop 2 and its immunogenicity].

Sichuan da xue xue bao. Yi xue ban = Journal of Sichuan University. Medical science edition·2009
Same author

Asparanin A induces G(2)/M cell cycle arrest and apoptosis in human hepatocellular carcinoma HepG2 cells.

Biochemical and biophysical research communications·2009
Same author

Pharmacophore modeling study based on known spleen tyrosine kinase inhibitors together with virtual screening for identifying novel inhibitors.

Bioorganic & medicinal chemistry letters·2009
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

This study introduces a novel method for building k-connected neighborhood graphs, essential for accurate geodesic distance estimation in data embedding. The approach improves distance accuracy, particularly for complex datasets.

Area of Science:

  • Data Science
  • Graph Theory
  • Computational Geometry

Background:

  • Geodesic distance estimation is crucial for isometric data embedding.
  • Existing methods for constructing neighborhood graphs face challenges with undersampled or non-uniformly distributed data.
  • The accurate construction of connected neighborhood graphs is a prerequisite for reliable geodesic distance calculations.

Purpose of the Study:

  • To propose a new algorithm for constructing k-connected neighborhood graphs.
  • To improve the accuracy of geodesic distance estimation in isometric data embedding.
  • To provide a robust method applicable to diverse and challenging datasets.

Main Methods:

  • A greedy algorithm is employed to iteratively add edges to the graph.

Related Experiment Videos

  • Edges are added in nondecreasing order of length.
  • K-connectedness is verified using a network flow technique with unit vertex capacities.

    • Main Results:

    • The proposed approach successfully constructs k-connected neighborhood graphs.
    • Experimental results demonstrate superior geodesic distance estimation compared to existing methods.
    • The method shows particular effectiveness on undersampled and non-uniformly distributed data.

    Conclusions:

    • The developed greedy algorithm provides an effective means for constructing k-connected neighborhood graphs.
    • This method enhances the accuracy of isometric data embedding through improved geodesic distance estimation.
    • The approach offers a valuable tool for analyzing complex and irregularly sampled datasets.