Sciweavers

2513 search results - page 28 / 503
» Improving Generalization by Data Categorization
Sort
View
KDD
1999
ACM
108views Data Mining» more  KDD 1999»
15 years 4 months ago
Mining the Most Interesting Rules
Several algorithms have been proposed for finding the “best,” “optimal,” or “most interesting” rule(s) in a database according to a variety of metrics including confid...
Roberto J. Bayardo Jr., Rakesh Agrawal
DMDW
2001
128views Management» more  DMDW 2001»
15 years 1 months ago
Improving Data Cleaning Quality Using a Data Lineage Facility
The problem of data cleaning, which consists of removing inconsistencies and errors from original data sets, is well known in the area of decision support systems and data warehou...
Helena Galhardas, Daniela Florescu, Dennis Shasha,...
JMLR
2010
153views more  JMLR 2010»
14 years 6 months ago
Generalized Expectation Criteria for Semi-Supervised Learning with Weakly Labeled Data
In this paper, we present an overview of generalized expectation criteria (GE), a simple, robust, scalable method for semi-supervised training using weakly-labeled data. GE fits m...
Gideon S. Mann, Andrew McCallum
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
16 years 1 months ago
Cost-Driven General Join View Maintenance over Distributed Data Sources
Maintaining materialized views that have join conditions between arbitrary pairs of data sources possibly with cycles is critical for many applications. In this work, we model vie...
Bin Liu, Elke A. Rundensteiner

Publication
417views
15 years 8 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos