Sciweavers

1601 search results - page 112 / 321
» Closed Sets for Labeled Data
Sort
View
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
15 years 10 months ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri
ICIP
2002
IEEE
16 years 7 months ago
Visualization of high dynamic range images
A novel paradigm for information visualization in high dynamic range images is presented in this paper. These images, real or synthetic, have luminance with typical ranges many or...
Alvaro Pardo, Guillermo Sapiro
NIPS
2003
15 years 7 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
COLT
2000
Springer
15 years 10 months ago
Model Selection and Error Estimation
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
Peter L. Bartlett, Stéphane Boucheron, G&aa...
CVPR
2008
IEEE
16 years 23 days ago
Object image retrieval by exploiting online knowledge resources
We describe a method to retrieve images found on web pages with specified object class labels, using an analysis of text around the image and of image appearance. Our method dete...
Gang Wang, David A. Forsyth