Sciweavers

719 search results - page 11 / 144
» Normalizing Incomplete Databases
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
CIKM
2010
Springer
13 years 5 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
ICML
2008
IEEE
14 years 8 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
ICCV
2005
IEEE
14 years 9 months ago
Shape and Appearance Repair for Incomplete Point Surfaces
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
Seyoun Park, Xiaohu Guo, Hayong Shin, Hong Qin