Sciweavers

387 search results - page 77 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
DATAMINE
2006
89views more  DATAMINE 2006»
13 years 7 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
UAI
2004
13 years 8 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
TKDE
2008
171views more  TKDE 2008»
13 years 7 months ago
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
Lei Chen 0002, Xiang Lian
SDM
2009
SIAM
119views Data Mining» more  SDM 2009»
14 years 4 months ago
Twin Vector Machines for Online Learning on a Budget.
This paper proposes Twin Vector Machine (TVM), a constant space and sublinear time Support Vector Machine (SVM) algorithm for online learning. TVM achieves its favorable scaling b...
Zhuang Wang, Slobodan Vucetic