Sciweavers

734 search results - page 31 / 147
» A New Indexing Method for High Dimensional Dataset
Sort
View
DMIN
2007
226views Data Mining» more  DMIN 2007»
13 years 10 months ago
Generative Oversampling for Mining Imbalanced Datasets
— One way to handle data mining problems where class prior probabilities and/or misclassification costs between classes are highly unequal is to resample the data until a new, d...
Alexander Liu, Joydeep Ghosh, Cheryl Martin
CVPR
2008
IEEE
14 years 10 months ago
Fast image search for learned metrics
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
Prateek Jain, Brian Kulis, Kristen Grauman
EDBT
2000
ACM
14 years 3 days ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
PAMI
2012
11 years 11 months ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
14 years 2 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei