Sciweavers

742 search results - page 56 / 149
» Model order selection for bio-molecular data clustering
Sort
View
ICPR
2010
IEEE
15 years 9 months ago
Probabilistic Clustering Using the Baum-Eagon Inequality
The paper introduces a framework for clustering data objects in a similarity-based context. The aim is to cluster objects into a given number of classes without imposing a hard pa...
Samuel Rota Bulo', Marcello Pelillo
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ICDE
2000
IEEE
112views Database» more  ICDE 2000»
16 years 7 months ago
DEMON: Mining and Monitoring Evolving Data
Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
MLDM
2005
Springer
15 years 11 months ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
CCGRID
2005
IEEE
15 years 11 months ago
Semantic integration of file-based data for grid services
Data services for the Grid have focussed so far primarily on virtualising access to distributed databases, and encapsulating file location. However, orchestration of services requ...
Andrew Woolf, Ray Cramer, Marta Gutierrez, Kerstin...