Sciweavers

133 search results - page 9 / 27
» Probabilistic Classification and Clustering in Relational Da...
Sort
View
BMCBI
2008
111views more  BMCBI 2008»
13 years 8 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
ESANN
2007
13 years 10 months ago
Mixtures of robust probabilistic principal component analyzers
Mixtures of probabilistic principal component analyzers model high-dimensional nonlinear data by combining local linear models. Each mixture component is specifically designed to...
Cédric Archambeau, Nicolas Delannay, Michel...
WWW
2006
ACM
14 years 9 months ago
Mining clickthrough data for collaborative web search
This paper is to investigate the group behavior patterns of search activities based on Web search history data, i.e., clickthrough data, to boost search performance. We propose a ...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
ADBIS
2007
Springer
132views Database» more  ADBIS 2007»
14 years 2 months ago
Clustering Approach to Generalized Pattern Identification Based on Multi-instanced Objects with DARA
Clustering is an essential data mining task with various types of applications. Traditional clustering algorithms are based on a vector space model representation. A relational dat...
Rayner Alfred, Dimitar Kazakov
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 10 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens