Sciweavers

332 search results - page 17 / 67
» Ranking and selecting clustering algorithms using a meta-lea...
Sort
View
KDD
2003
ACM
195views Data Mining» more  KDD 2003»
14 years 9 months ago
Visualizing changes in the structure of data for exploratory feature selection
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...
Elias Pampalk, Werner Goebl, Gerhard Widmer
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 8 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
ICDM
2006
IEEE
100views Data Mining» more  ICDM 2006»
14 years 2 months ago
Meta Clustering
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...
Rich Caruana, Mohamed Farid Elhawary, Nam Nguyen, ...
ICIP
2002
IEEE
14 years 1 months ago
An iterative algorithm for context selection in adaptive entropy coders
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
Tong Jin, Jacques Vaisey
HT
2009
ACM
13 years 6 months ago
Retrieving broken web links using an approach based on contextual information
In this short note we present a recommendation system for automatic retrieval of broken Web links using an approach based on contextual information. We extract information from th...
Juan Martinez-Romo, Lourdes Araujo