Sciweavers

1599 search results - page 100 / 320
» Theoretical Frameworks for Data Mining
Sort
View
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
15 years 11 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
14 years 10 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
TCS
2011
14 years 4 months ago
An algorithmic framework for network reconstruction
Models of biological systems and phenomena are of high scientific interest and practical relevance, but not always easy to obtain due to their inherent complexity. To gain the re...
Markus Durzinsky, Annegret Wagler, Robert Weismant...
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
15 years 11 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
SAC
2006
ACM
15 years 3 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht