Sciweavers

2137 search results - page 70 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 10 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
JSS
2007
121views more  JSS 2007»
13 years 7 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...
AI
2006
Springer
13 years 11 months ago
A New Profile Alignment Method for Clustering Gene Expression Data
We focus on clustering gene expression temporal profiles, and propose a novel, simple algorithm that is powerful enough to find an efficient distribution of genes over clusters. We...
Ataul Bari, Luis Rueda
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 4 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...