Result: Visualization of large networks with min-cut plots, A-plots and R-MAT

Title:
Visualization of large networks with min-cut plots, A-plots and R-MAT
Authors:
CHAKRABARTI, Deepayan, FALOUTSOS, Christos, YIPING ZHAN
Source:
Ambient intelligenceInternational journal of human-computer studies. 65(5):434-445
Publisher Information:
London: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 1/2 p
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Psychology, psychopathology, psychiatry, Psychologie, psychopathologie, psychiatrie, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Anneau, Ring, Anillo, Asservissement visuel, Visual servoing, Servomando visual, Interface utilisateur, User interface, Interfase usuario, Internet, Matrice adjacence, Adjacency matrix, Matriz adyacencia, Modélisation, Modeling, Modelización, Monnaie, Money, Moneda, Observation aberrante, Outlier, Observación aberrante, Prévision, Forecasting, Previsión, Réseau social, Social network, Red social, Réseau web, World wide web, Red WWW, Simulation ordinateur, Computer simulation, Simulación computadora, Sous graphe, Subgraph, Subgrafo, Système réparti, Distributed system, Sistema repartido, Terrorisme, Terrorism, Terrorismo, Visualisation, Visualization, Visualización, A-plots, Abnormal subgraphs, Graph generator, Min-cut plots, R-MAT
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Yahoo ! Research, 701 1st Ave, Sunnyvale, CA 94089, United States
School of Computer Science, CMU, Pittsburgh, PA 15213, United States
Department of Biological Sciences and School of Computer Science, CMU, Pittsburgh, PA 15213, United States
ISSN:
1071-5819
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18654469
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18654469
Database:
PASCAL Archive

Further Information

What does a normal computer (or social) network look like? How can we spot abnormal sub-networks in the Internet, or web graph? The answer to such questions is vital for outlier detection (terrorist networks, or illegal money-laundering rings), forecasting, and simulations (how will a computer virus spread?). The heart of the problem is finding the properties of real graphs that seem to persist over multiple disciplines. We list such patterns and laws, including the min-cut plots discovered by us. This is the first part of our NetMine package: given any large graph, it provides visual feedback about these patterns; any significant deviations from the expected patterns can thus be immediately flagged by the user as abnormalities in the graph. The second part of NetMine is the A-plots tool for visualizing the adjacency matrix of the graph in innovative new ways, again to find outliers. Third, NetMine contains the R-MAT (Recursive MATrix) graph generator, which can successfully model many of the patterns found in real-world graphs and quickly generate realistic graphs, capturing the essence of each graph in only a few parameters. We present results on multiple, large real graphs, where we show the effectiveness of our approach.