Sciweavers

4124 search results - page 380 / 825
» Improved Algorithms for Data Migration
Sort
View
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
15 years 10 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 11 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
Liangxiao Jiang, Harry Zhang, Jiang Su
SIGMOD
2001
ACM
160views Database» more  SIGMOD 2001»
16 years 6 months ago
Adaptive Precision Setting for Cached Approximate Values
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
Chris Olston, Boon Thau Loo, Jennifer Widom
SDM
2010
SIAM
226views Data Mining» more  SDM 2010»
15 years 7 months ago
Two-View Transductive Support Vector Machines
Obtaining high-quality and up-to-date labeled data can be difficult in many real-world machine learning applications, especially for Internet classification tasks like review spam...
Guangxia Li, Steven C. H. Hoi, Kuiyu Chang
125
Voted
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
15 years 8 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan