Sciweavers

29 search results - page 5 / 6
» A new suffix tree similarity measure for document clustering
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 10 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CIARP
2005
Springer
13 years 11 months ago
Dynamic Hierarchical Compact Clustering Algorithm
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
Reynaldo Gil-García, José Manuel Bad...
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
13 years 11 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
ICSM
2009
IEEE
13 years 12 months ago
Scalable and incremental clone detection for evolving software
Code clone management has been shown to have several benefits for software developers. When source code evolves, clone management requires a mechanism to efficiently and increme...
Tung Thanh Nguyen, Hoan Anh Nguyen, Jafar M. Al-Ko...
MSR
2006
ACM
13 years 11 months ago
An open framework for CVS repository querying, analysis and visualization
We present an open framework for visual mining of CVS software repositories. We address three aspects: data extraction, analysis and visualization. We first discuss the challenges...
Lucian Voinea, Alexandru Telea