Sciweavers

2090 search results - page 151 / 418
» Learning with attribute costs
Sort
View
ICMLA
2009
13 years 7 months ago
Discovering Characterization Rules from Rankings
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
Ansaf Salleb-Aouissi, Bert C. Huang, David L. Walt...
MLDM
2010
Springer
13 years 4 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
VLDB
2003
ACM
123views Database» more  VLDB 2003»
14 years 9 months ago
A case for fractured mirrors
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 6 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
MDM
2009
Springer
118views Communications» more  MDM 2009»
14 years 3 months ago
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haib...