Sciweavers

627 search results - page 95 / 126
» Structural Learning of Activities from Sparse Datasets
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
PERCOM
2010
ACM
13 years 10 months ago
Collaborative real-time speaker identification for wearable systems
We present an unsupervised speaker identification system for personal annotations of conversations and meetings. The system dynamically learns new speakers and recognizes already k...
Mirco Rossi, Oliver Amft, Martin Kusserow, Gerhard...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 1 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last
CORR
2011
Springer
150views Education» more  CORR 2011»
13 years 3 months ago
Total variation regularization for fMRI-based prediction of behaviour
—While medical imaging typically provides massive amounts of data, the extraction of relevant information for predictive diagnosis remains a difficult challenge. Functional MRI ...
Vincent Michel, Alexandre Gramfort, Gaël Varo...
BMCBI
2005
126views more  BMCBI 2005»
13 years 8 months ago
GANN: Genetic algorithm neural networks for the detection of conserved combinations of features in DNA
Background: The multitude of motif detection algorithms developed to date have largely focused on the detection of patterns in primary sequence. Since sequence-dependent DNA struc...
Robert G. Beiko, Robert L. Charlebois