Sciweavers

1492 search results - page 279 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View
BMCBI
2008
111views more  BMCBI 2008»
14 years 9 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...
BMCBI
2005
100views more  BMCBI 2005»
14 years 9 months ago
EvDTree: structure-dependent substitution profiles based on decision tree classification of 3D environments
Background: Structure-dependent substitution matrices increase the accuracy of sequence alignments when the 3D structure of one sequence is known, and are successful e.g. in fold ...
Jean-Christophe Gelly, Laurent Chiche, Jér&...
ISBI
2011
IEEE
14 years 1 months ago
Group sparsity based classification for cervigram segmentation
This paper presents an algorithm to classify pixels in uterine cervix images into two classes, namely normal and abnormal tissues, and simultaneously select relevant features, usi...
Yang Yu, Junzhou Huang, Shaoting Zhang, Christophe...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
15 years 10 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
76
Voted
IPM
2007
145views more  IPM 2007»
14 years 9 months ago
Text mining techniques for patent analysis
Patent documents contain important research results. However, they are lengthy and rich in technical terminology such that it takes a lot of human efforts for analyses. Automatic...
Yuen-Hsien Tseng, Chi-Jen Lin, Yu-I Lin