Metric-Based Classification of Graph Vertices
PublicContenu téléchargeable
open in viewerIn their 2013 paper, Cao et. al introduce the diffusion state distance (DSD) metric on graphs for use in the vertex labeling problem on protein-protein interaction networks. We generalize their classification approach, which uses weighted k-nearest neighbors voting, to work with any graph metric. We analyze the performance of this approach on graphs resembling real-world networks using shortest-path distance, DSD, and resistance distance. To this end, we propose novel simulation models to generate labeled scale-free and small-world networks, and perform label prediction experiments on the simulated graphs as well as real-world networks. We conclude that the DSDbased prediction algorithm exhibits more robust community awareness than the ones using the other metrics.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Creator
- Publisher
- Identifier
- E-project-042419-220510
- Advisor
- Year
- 2019
- Date created
- 2019-04-24
- Resource type
- Major
- Rights statement
Relations
- Dans Collection:
Contenu
Articles
La vignette | Titre | Visibilité | Embargo Release Date | actes |
---|---|---|---|---|
MQP_djkim_jepugmire.pdf | Public | Télécharger |
Permanent link to this page: https://digital.wpi.edu/show/kw52jb77m