Sciweavers

798 search results - page 51 / 160
» Engineering graph clustering: Models and experimental evalua...
Sort
View
PKDD
2009
Springer
175views Data Mining» more  PKDD 2009»
16 years 13 days ago
Latent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
Pu Wang, Carlotta Domeniconi, Kathryn B. Laskey
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
15 years 11 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 6 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
ICSM
2005
IEEE
15 years 11 months ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer
CSL
1998
Springer
15 years 5 months ago
Model parameter estimation for mixture density polynomial segment models
In this paper, we propose parameter estimation techniques for mixture density polynomial segment models (MDPSMs) where their trajectories are specified with an arbitrary regressi...
Toshiaki Fukada, Kuldip K. Paliwal, Yoshinori Sagi...