Sciweavers

15 search results - page 2 / 3
» Multi-assignment clustering for Boolean data
Sort
View
IDA
2005
Springer
13 years 11 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut
KDD
2004
ACM
314views Data Mining» more  KDD 2004»
14 years 6 months ago
Assessment of discretization techniques for relevant pattern discovery from gene expression data
In the domain of gene expression data analysis, various researchers have recently emphasized the promising application of pattern discovery techniques like association rule mining...
Ruggero G. Pensa, Claire Leschi, Jéré...
CEC
2007
IEEE
14 years 3 days ago
A co-evolutionary framework for regulatory motif discovery
Abstract— In previous work, we have shown how an evolutionary algorithm with a clustered population can be used to concurrently discover multiple regulatory motifs present within...
Michael A. Lones, Andy M. Tyrrell
KDD
2002
ACM
154views Data Mining» more  KDD 2002»
14 years 6 months ago
Mining Protein Contact Maps
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
14 years 7 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh