Sciweavers

2227 search results - page 15 / 446
» Graph Mining based on a Data Partitioning Approach
Sort
View
199
Voted
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
16 years 1 months ago
Distance Based Subspace Clustering with Flexible Dimension Partitioning
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
Guimei Liu, Jinyan Li, Kelvin Sim, Limsoon Wong
CIKM
2009
Springer
15 years 5 months ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
PAKDD
2007
ACM
143views Data Mining» more  PAKDD 2007»
15 years 6 months ago
Clustering Ensembles Based on Normalized Edges
The co-association (CA) matrix was previously introduced to combine multiple partitions. In this paper, we analyze the CA matrix, and address its difference from the similarity ma...
Yan Li, Jian Yu, Pengwei Hao, Zhulin Li
109
Voted
BMCBI
2010
144views more  BMCBI 2010»
15 years 15 days ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 24 days ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni