Sciweavers

1314 search results - page 135 / 263
» Approximate data mining in very large relational data
Sort
View
BMCBI
2008
185views more  BMCBI 2008»
15 years 1 months ago
Mining clinical relationships from patient narratives
Background: The Clinical E-Science Framework (CLEF) project has built a system to extract clinically significant information from the textual component of medical records in order...
Angus Roberts, Robert J. Gaizauskas, Mark Hepple, ...
VLDB
2004
ACM
180views Database» more  VLDB 2004»
15 years 7 months ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
147
Voted
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 7 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
KAIS
2006
126views more  KAIS 2006»
15 years 1 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 8 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...