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

Pattern vectors from algebraic graph theory.

Richard C Wilson1, Edwin R Hancock, Bin Luo

  • 1Department of Computer Science, University of York, Heslington, York Y01 5DD, UK. wilson@cs.york.ac.uk

IEEE Transactions on Pattern Analysis and Machine Intelligence
|July 15, 2005
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

A probe-free electrochemical immunosensor for methyl jasmonate based on ferrocene functionalized-carboxylated graphene-multi-walled carbon nanotube nanocomposites.

Talanta·2021
Same author

Long-Term Kidney Outcomes Following Dialysis-Treated Childhood Acute Kidney Injury: A Population-Based Cohort Study.

Journal of the American Society of Nephrology : JASN·2021
Same author

Synergistic regulation of methylation and SP1 on MAGE-D4 transcription in glioma.

American journal of translational research·2021
Same author

Incidence of Major Adverse Cardiovascular Events and Cardiac Mortality in High-Risk Kidney-Only and Simultaneous Pancreas-Kidney Transplant Recipients.

Kidney international reports·2021
Same author

The laterodorsal tegmentum-ventral tegmental area circuit controls depression-like behaviors by activating ErbB4 in DA neurons.

Molecular psychiatry·2021
Same author

Frequency splicing code-based Brillouin optical time domain collider for fast dynamic measurement.

Optics express·2021
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 spectral decomposition method for analyzing graph structures, converting complex graph data into feature vectors for pattern analysis. This approach effectively overcomes computational challenges in graph pattern recognition and enables clear graph clustering.

Area of Science:

  • Graph theory
  • Machine learning
  • Spectral graph theory

Background:

  • Graph structures present computational challenges for pattern analysis due to the need for node correspondence.
  • Existing methods struggle with graphs of varying sizes and complex attributes.

Purpose of the Study:

  • To develop a computationally efficient method for graph pattern analysis.
  • To represent graphs as feature vectors for pattern recognition and clustering.
  • To extend graph representation to include node and edge attributes.

Main Methods:

  • Utilized spectral decomposition of the Laplacian matrix to derive permutation-invariant polynomials.
  • Constructed graph features from coefficients of these polynomials.
  • Extended the method using Hermitian property matrices for graphs with node and edge attributes.

Related Experiment Videos

  • Employed dimensionality reduction techniques like PCA, MDS, and LPP for embedding graph feature vectors.

    • Main Results:

    • Demonstrated that spectral feature vectors can discriminate between graphs based on structure.
    • Showcased the ability of spectral embeddings to form well-defined graph clusters.
    • Validated the approach on both synthetic and real-world datasets.

    Conclusions:

    • The spectral decomposition method offers an effective solution for computationally intensive graph pattern analysis.
    • The proposed feature representation and embedding strategies facilitate graph clustering and discrimination.
    • This approach provides a robust framework for analyzing complex graph structures with attributes.