Sciweavers

9209 search results - page 101 / 1842
» Data Space Randomization
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
16 years 1 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
ICCVW
1999
Springer
15 years 9 months ago
A General Method for Feature Matching and Model Extraction
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
Clark F. Olson
ICASSP
2011
IEEE
14 years 8 months ago
A kernelized maximal-figure-of-merit learning approach based on subspace distance minimization
We propose a kernelized maximal-figure-of-merit (MFoM) learning approach to efficiently training a nonlinear model using subspace distance minimization. In particular, a fixed,...
Byungki Byun, Chin-Hui Lee
EMMCVPR
2011
Springer
14 years 4 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
15 years 6 months ago
Towards Attack-Resilient Geometric Data Perturbation
Data perturbation is a popular technique for privacypreserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are no...
Keke Chen, Gordon Sun, Ling Liu