Sciweavers

513 search results - page 5 / 103
» Software Components Capture Using Graph Clustering
Sort
View
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 29 days ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
PC
2010
177views Management» more  PC 2010»
13 years 6 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
TKDE
2011
280views more  TKDE 2011»
13 years 2 months ago
Locally Consistent Concept Factorization for Document Clustering
—Previous studies have demonstrated that document clustering performance can be improved significantly in lower dimensional linear subspaces. Recently, matrix factorization base...
Deng Cai, Xiaofei He, Jiawei Han
WSR
2008
13 years 9 months ago
Using Library Dependencies for Clustering
Abstract: Software clustering is an established approach to automatic architecture recovery. It groups components that are in some way similar to each other. Usually, the similarit...
Jochen Quante