Sciweavers

1146 search results - page 40 / 230
» Optimizing Frequency Queries for Data Mining Applications
Sort
View
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
14 years 9 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
14 years 3 months ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
DOLAP
1999
ACM
14 years 1 months ago
Design and Selection of Materialized Views in a Data Warehousing Environment: A Case Study
In this paper, we describe the design of a data warehousing system for an engineering company ‘R’. This system aims to assist users in retrieving data for business analysis in...
Goretti K. Y. Chan, Qing Li, Ling Feng
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 1 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 2 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu