Sciweavers

1403 search results - page 26 / 281
» Set cover algorithms for very large datasets
Sort
View
DRR
2003
13 years 9 months ago
Correcting OCR text by association with historical datasets
The Medical Article Records System (MARS) developed by the Lister Hill National Center for Biomedical Communications uses scanning, OCR and automated recognition and reformatting ...
Susan E. Hauser, Jonathan Schlaifer, Tehseen F. Sa...
ICDM
2002
IEEE
153views Data Mining» more  ICDM 2002»
14 years 1 months ago
Generating an informative cover for association rules
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
Laurentiu Cristofor, Dan A. Simovici
ICAISC
2010
Springer
13 years 8 months ago
Pruning Classification Rules with Reference Vector Selection Methods
Attempts to extract logical rules from data often lead to large sets of classification rules that need to be pruned. Training two classifiers, the C4.5 decision tree and the Non-Ne...
Karol Grudzinski, Marek Grochowski, Wlodzislaw Duc...
WSDM
2012
ACM
252views Data Mining» more  WSDM 2012»
12 years 4 months ago
WebSets: extracting sets of entities from the web using unsupervised information extraction
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
Bhavana Bharat Dalvi, William W. Cohen, Jamie Call...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 2 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...