Sciweavers

732 search results - page 115 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
VLDB
1998
ACM
105views Database» more  VLDB 1998»
13 years 12 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
KES
2009
Springer
14 years 2 months ago
A Platform for Extracting and Storing Web Data
The web data or data originated on the Web contain information and knowledge which allows improving web site efficiency and effectiveness to attract and retain visitors. However, w...
L. Víctor Rebolledo, Juan D. Velásqu...
ALMOB
2006
80views more  ALMOB 2006»
13 years 7 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel