Sciweavers

128 search results - page 12 / 26
» On Mining Closed Sets in Multi-Relational Data
Sort
View
ICTAI
2003
IEEE
15 years 2 months ago
Integrating Microarray Data by Consensus Clustering
With the exploding volume of microarray experiments comes increasing interest in mining repositories of such data. Meaningfully combining results from varied experiments on an equ...
Vladimir Filkov, Steven Skiena
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
13 years 2 days ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 3 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 1 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg
AVI
2004
14 years 11 months ago
SWAPit: a multiple views paradigm for exploring associations of texts and structured data
Visualization interfaces that offer multiple coordinated views on a particular set of data items are useful for navigating and exploring complex information spaces. In this paper ...
Andreas Becks, Christian Seeling