Strahler based graph clustering using convolution

Proceedings of the International Conference on Information Visualization

Volumn 8, Issue , 2004, Pages 44-51

  Auber, David ^a   Delest, Maylis ^a   Chiricota, Yves ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; CONVOLUTION; DATABASE SYSTEMS; FUNCTIONS; HEURISTIC METHODS; LEGACY SYSTEMS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; ROBOTICS; VISUALIZATION;

FRAGMENTATION TECHNIQUES; GRAPH CLUSTERING; LEGACY CODES; STRAHLER NUMBERS;

GRAPH THEORY;

EID: 4644316603     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: a survey. Integration: the VLSI Journal, 19:1-81, 1995.
2. D. Auber. Outils de visualisation de larges structures de données. Thése UniversitÉ Bordeaux 1, LaBRI, 2002.
3. D. Auber. Using strahler numbers for real time visual exploration of huge graphs. In International Conference on Computer Vision and Graphics, ICCVG2002, pages 56-69, September 2002.
4. D. Auber. Tulip - a huge graph visualization framework. In M. J. P. Mutzel, editor, Graph Drawing Software Book, Mathematics and visualization. Springer-Verlag, 2003. To appear.
5. D. Auber, M. Delest, J. Fédou, J. Domenger, and P. Duchon. New strahler numbers for rooted plane trees. In M. Drmota, editor, Third Colloquium on Mathematics and Computer Science, Algorithms, Trees, Combinatorics and Probabilities, page To appear. Vienna University of Technology, Birkhuser, 2004.
6. N. Chen, A. Chen, L. Zhou, and L. Lu. A graph-based clustering algorithm in large transaction databases. Intelligent Data Analysis, 5(4):327-338, 2001.
7. M. Delest, A. Don, and J. Benois-Pineau. Graph-based interfaces for navigation in indexed video content. In CBMI03, pages 49-55, Rennes(France), 2003. IRISA.
8. A. Enright, S. V. Dongen, and C. Ouzounis. An efficient algorithm for large-scale detection of protein families. Nucleic Acids Research, 30(7): 1575-1584, 2002.
9. A. P. Ershov. On programming of arithmetic operations. Com, of the A.C.M, 1(8):3-6, 1958.
10. P. Flajolet, J. Raoult, and J. Vuillemin. The number of registers required for evaluating arithmetic expressions. Theoritical Computer Science, 8:99-125, 1979.
11. R. E. Horton. Erosional development of streams and their drainage basins; hydro-physical approach to quantitative morphology. Bulletin of the Geological Society of America, 56:275-370, 1945.
12. G. M. I. Herman, M.S. Marshall. Density functions for visual attributes and effective partitioning in graph visualization. In S. Roth and D. Keim, editors, IEEE Information Visualization Symposium, pages 49-56. IEEE CS Press, 2000.
13. H. Kawaji, Y. Yamaguchil, H. Matsuda, and A. Hashimoto. A graph-based clustering method for a large set of sequences using a graph partitioning algorithm. In Genome Informatics, volume 12, pages 93-102, 2001.
14. R. Koschke and T. Eisenbarth. A framework for experimental evaluation of clustering techniques. In I. C. S. Press, editor, International Workshop on Program Comprehension, pages 201-210, 2000.
15. D. Maio, D. Maltoni, and S. Rizzi. Dynamic clustering of maps in autonomous agents. Transactions on Pattern Analysis and Machine Intelligence, 18(11):1080-1091, 1996.
16. S. Mancoridis, B. Mitchell, Y. Chen, and E. Gansner. Bunch: A clustering tool for the recovery and maintenance of software system structures. In International Conference on Software Maintenance, pages 50-62. IEEE Computer Society, 1999.
17. S. Mancoridis, B. Mitchell, C. Rorres, Y. Chen, and E. Gansner. Using automatic clustering to produce high-level system organizations of source code. In International Workshop on Program Comprehension. IEEE Computer Society, 1998.
18. S. Rizzi. Genetic operators for hierarchical graph clustering. Pattern Recognition Letters, 19(14):1293-1300, 1998.
19. P. Salembier and R. Smith. Mpeg-7 multimedia description schemes. IEEE Transactions on Circuits and Systems for Vido technology, 11:748-759, 2001".
20. B. Shneiderman. The eyes have it: A task by data type taxonomy for information visualization. In Boulder, editor, IEEE Conference on visual languages, pages 336-343, 1996.
21. A. N. Strahler. Hypsometric (area-altitude) analysis of erosional topology. Bulletin of the Geological Society of America, 63:1117-1142, 1952.
22. V. Tzerpos and R. Holt. Mojo: A distance metric for software clustering. In I. C. Society, editor, 6th Working Conference on Reverse Engineering, pages 187-193, October 1999.
23. V. Tzerpos and R. Holt. On the stability of software clustering algorithms. In I. C. Society, editor, 8th International Workshop on Program Comprehension, pages 211-220, June 2000.
24. G. Viennot, G. Eyrolles, N. Janey, and D.Arques. Combinatorial analysis of ramified patters and computer imagery of trees. In SIGGRAPH Conference, volume 23 of Computer Graphics, pages 31-40, 1989.
25. T. A. Wiggerts. Using clustering algorithms in legacy systems remodularization. In 4th Working Conference on Reverse Engineering, pages 33-43. Institute of Electrical and Electronics Engineers, 1997.