Sciweavers

528 search results - page 45 / 106
» Mining Subspace Correlations
Sort
View
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 9 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
DAWAK
2008
Springer
13 years 9 months ago
Mining Multidimensional Sequential Patterns over Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery and has been widely studied for over a decade by data mining researchers. More and more, with the ...
Chedy Raïssi, Marc Plantevit
BMCBI
2007
168views more  BMCBI 2007»
13 years 7 months ago
Automatic extraction of gene ontology annotation and its correlation with clusters in protein networks
Background: Uncovering cellular roles of a protein is a task of tremendous importance and complexity that requires dedicated experimental work as well as often sophisticated data ...
Nikolai Daraselia, Anton Yuryev, Sergei Egorov, Il...
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
14 years 9 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 20 days ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...