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

Hierarchical graph visualization using neural networks.

K Kusnadi1, J D Carothers, F Chow

  • 1Dept. of Electr. and Comput. Eng., Arizona Univ., Tucson, AZ.

IEEE Transactions on Neural Networks
|January 1, 1997
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

Breast-to-brain metastasis is exacerbated with chemotherapy through blood-cerebrospinal fluid barrier and induces Alzheimer's-like pathology.

Journal of neuroscience research·2023
Same author

Comparative efficacy, safety, and cardiovascular outcomes with once-weekly subcutaneous semaglutide in the treatment of type 2 diabetes: Insights from the SUSTAIN 1-7 trials.

Diabetes & metabolism·2019
Same author

Burden of neuroinfectious diseases on the neurology service in a tertiary care center.

Neurology·2008
Same author

Digraph visualization using a neural algorithm with a heuristic activation scheme.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2008
Same author

Faster power estimation of CMOS designs using vector compaction - a fractal approach.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2008
Same author

Association between sleeping hours, working hours and obesity in Hong Kong Chinese: the 'better health for better Hong Kong' health promotion campaign.

International journal of obesity (2005)·2006
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

A new Hopfield network algorithm optimizes hierarchical graph visualization by minimizing crossings and path length. This global approach reduces path length by up to 50% compared to traditional methods, improving drawing interpretability.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Data Visualization

Background:

  • Hierarchical graph visualization aims to create easily interpretable 2D drawings.
  • Traditional methods often use sequential, local optimization heuristics.
  • These heuristics may not achieve optimal global solutions for readability criteria.

Purpose of the Study:

  • To present a novel algorithm for hierarchical graph visualization.
  • To utilize a Hopfield network for global optimization of visualization parameters.
  • To simultaneously minimize edge crossings and total path length.

Main Methods:

  • Developed an algorithm based on Hopfield network principles.
  • Applied the algorithm to the hierarchical graph visualization problem.

Related Experiment Videos

  • Compared performance against traditional barycentric and priority layout heuristics.

    • Main Results:

    • The Hopfield network algorithm achieved crossing minimization comparable to the barycentric heuristic.
    • Simultaneously reduced total path length by up to 50% compared to the priority layout heuristic.
    • Produced 2D drawings with improved interpretability.

    Conclusions:

    • Hopfield networks offer a viable global optimization approach for graph visualization.
    • This method effectively balances minimizing crossings and path length.
    • The algorithm demonstrates significant improvements over existing heuristic methods.