Parallel PathFinder algorithms for mining structures from graphs

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2009, Pages 812-817

  Hauguel, Samson ^a   Zhai, ChengXiang ^a   Han, Jiawei ^a  

^a University of Illinois at Urbana Champaign ^*  (United States)

Author keywords

Graph mining; Parallel computing

Indexed keywords

COMPUTATION COSTS; GRAPH MINING; GRAPHICAL DATA; HARDWARE PLATFORM; KNOWLEDGE EXTRACTION; MATHEMATICAL PROPERTIES; MULTI CORE; NETWORK VISUALIZATION; PARALLEL COMPUTING; PARALLELIZATIONS; PATHFINDER ALGORITHM; PATHFINDER NETWORKS; REDUCTION ALGORITHMS; SPEED-UPS; STATE-OF-THE-ART ALGORITHMS;

ALGORITHMS; DATA VISUALIZATION; PARALLEL ARCHITECTURES; VISUALIZATION;

COMPUTATIONAL EFFICIENCY;

EID: 77951170324     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2009.142     Document Type: Conference Paper

References (15)

1. Schvaneveldt, R. W. (Ed.) (1990) Pathfinder Associative Networks: Studies in Knowledge Organization. Norwood, NJ: Ablex.
2. Schvaneveldt, R. W., Durso, F. T., & Dearholt, D. W. (1989). Network structures in proximity data. In G. Bower (Ed.), The psychology of learning and motivation: Advances in research and theory, Vol. 24 (pp. 249-284). New York: Academic Press.
3. V.P. Guerrero-Bote, F. Zapico-Alonso, M.E. Espinosa-Calvo, R.G. Crisostomo, F. de Moya-Anegon (2006) Binary Pathfinder : An imporvement to the Pathfinder algorithm, Information processing and Management, 42, 1484-1490.
4. A. Quirin, O. Cordon, J. Santamaria, B. Vargas-Quesada, F. Moya-Anegon (2007), A New Variant of the pathfinder algorithm to generate large visual science maps in cubic time, Information processing and Management.
5. Ojmason, Fast PFNETs in Erlang, http://omlog.wordpress.com/2009/02/14/ fast-pfnets-in-erlang/.
6. C. Chen et al 1999, Generalised similarity analysis and Pathfinder network scaling, Interacting with Computers, 10 (2): pp. 107-128.
7. C. Chen et al 2003, Visualizing evolving networks: minimum spanning trees versus pathfinder networks, Information Visualization. INFOVIS2003. IEEE Symposium on.
8. C.Chen et al 1998, Bridging the gap: The use of pathfinder networks in visual navigation, Journal of Visual Languages and Computing, 9 (3): pp. 267-286.
9. H. White 2003, Pathfinder networks and author co-citation analysis: a remapping of paradigmatic information scientists, Journal of the American Society for Information Science and Technology, 54 (5): pp.423-434.
10. F. Viger, M. Latapy (2004) Random generation of large connected simple graphs with prescribed degree distribution, Lecture Notes in Computer Science 2005: pp.440 -449. http://wwwrp.lip6.fr/~latapy/FV/generation.html.
11. Metis, graph partitioning algorithm. http://glaros.dtc.umn.edu/gkhome/ metis/metis/download.
12. Multilevel Algorithms for Partitioning Power-Law Graphs. Amine Abou-Rjeili and George Karypis. IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006.
13. Multi-Constraint Mesh Partitioning for Contact/Impact Computations. George Karypis. Supercomputing, 2003.
14. A fast and high quality multilevel scheme for partitioning irregular graphs. George Karypis and Vipin Kumar. SIAM Journal on Scientific Computing, Vol. 20, No. 1, pp. 359 -392, 1999.
15. J. Han, M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2005.