Sciweavers

1601 search results - page 151 / 321
» Closed Sets for Labeled Data
Sort
View
IDEAS
2005
IEEE
142views Database» more  IDEAS 2005»
15 years 12 months ago
Automatically Maintaining Wrappers for Web Sources
A substantial subset of the web data follows some kind of underlying structure. Nevertheless, HTML does not contain any schema or semantic information about the data it represents...
Juan Raposo, Alberto Pan, Manuel Álvarez, J...
COMSIS
2010
15 years 3 months ago
Effective semi-supervised nonlinear dimensionality reduction for wood defects recognition
Dimensionality reduction is an important preprocessing step in high-dimensional data analysis without losing intrinsic information. The problem of semi-supervised nonlinear dimensi...
Zhao Zhang, Ning Ye
ICFCA
2009
Springer
16 years 1 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
VL
2003
IEEE
134views Visual Languages» more  VL 2003»
15 years 11 months ago
End-user programming as translation: an experimental framework and study
One of the reputed advantages of end-user programming languages is that they support a given problem doh a set of programming abstractions that are “just right” for the end-us...
Christopher D. Hundhausen, Ravikiran Vatrapu, Josh...
ECCV
2010
Springer
15 years 11 months ago
Building Compact Local Pairwise Codebook with Joint Feature Space Clustering
Abstract. This paper presents a simple, yet effective method of building a codebook for pairs of spatially close SIFT descriptors. Integrating such codebook into the popular bag-o...