Classy: fast clustering streams of call-graphs
- 10 July 2014
- journal article
- research article
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 28 (5-6) , 1554-1585
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- Approximate graph edit distance computation by means of bipartite graph matchingImage and Vision Computing, 2009
- Efficient query processing on graph databasesACM Transactions on Database Systems, 2009
- Graph clusteringComputer Science Review, 2007
- Testing malware detectorsACM SIGSOFT Software Engineering Notes, 2004
- Clustering data streams: theory and practiceIEEE Transactions on Knowledge and Data Engineering, 2003
- Coding and comparison of DAG's as a novel neural structure with applications to on-line handwriting recognitionIEEE Transactions on Signal Processing, 1997
- Comparing partitionsJournal of Classification, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- Some approaches to best-match file searchingCommunications of the ACM, 1973
- A Theorem on Boolean MatricesJournal of the ACM, 1962