Sciweavers

155 search results - page 27 / 31
» An efficient algorithm for mining closed inter-transaction i...
Sort
View
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 1 days ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
16 years 1 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
DMKD
2003
ACM
96views Data Mining» more  DMKD 2003»
15 years 4 months ago
Using transposition for pattern discovery from microarray data
We analyze expression matrices to identify a priori interesting sets of genes, e.g., genes that are frequently co-regulated. Such matrices provide expression values for given biol...
François Rioult, Jean-François Bouli...
217
Voted
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 1 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
99
Voted
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 5 days ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer