Sciweavers

493 search results - page 81 / 99
» Efficient Pattern Mining of Uncertain Data with Sampling
Sort
View
DMIN
2006
137views Data Mining» more  DMIN 2006»
13 years 10 months ago
Discovering of Frequent Itemsets with CP-mine Algorithm
Efficient algorithms to discover frequent patterns are crucial in data mining research. Several effective data structures, such as two-dimensional arrays, graphs, trees, and tries ...
Nuansri Denwattana, Yutthana Treewai
BMCBI
2010
154views more  BMCBI 2010»
13 years 9 months ago
LINNAEUS: A species name identification system for biomedical literature
Background: The task of recognizing and identifying species names in biomedical literature has recently been regarded as critical for a number of applications in text and data min...
Martin Gerner, Goran Nenadic, Casey M. Bergman
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 10 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
14 years 1 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng
TKDE
2008
153views more  TKDE 2008»
13 years 8 months ago
Discovering Frequent Agreement Subtrees from Phylogenetic Data
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Sen Zhang, Jason Tsong-Li Wang