Sciweavers

860 search results - page 98 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
14 years 2 days ago
Data Reduction Based on Hyper Relations
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...
Hui Wang, Ivo Düntsch, David A. Bell
ICDAR
2005
IEEE
14 years 1 months ago
Text Degradations and OCR Training
Printing and scanning of text documents introduces degradations to the characters which can be modeled. Interestingly, certain combinations of the parameters that govern the degra...
Elisa H. Barney Smith, Tim L. Andersen
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 1 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
MACOM
2010
13 years 2 months ago
On the Performance of Single LDGM Codes for Iterative Data Fusion over the Multiple Access Channel
One of the applications of wireless sensor networks currently undergoing active research focuses on the scenario where the information generated by a data source S is simultaneousl...
Javier Del Ser, Javier Garcia-Frias, Pedro M. Cres...
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu