Sciweavers

822 search results - page 129 / 165
» Case Mining from Large Databases
Sort
View
ICDE
2000
IEEE
82views Database» more  ICDE 2000»
14 years 9 months ago
Similarity Search for Multidimensional Data Sequences
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Ho...
CIKM
2004
Springer
14 years 1 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
WWW
2006
ACM
14 years 8 months ago
Time-dependent semantic similarity measure of queries using historical click-through data
It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of clickthrough data logged by Web search engines, which record the...
Qiankun Zhao, Steven C. H. Hoi, Tie-Yan Liu, Soura...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
13 years 11 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula