Sciweavers

8614 search results - page 1630 / 1723
» Mining
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 8 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
14 years 8 months ago
Exploiting context analysis for combining multiple entity resolution systems
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
14 years 8 months ago
DiMaC: a system for cleaning disguised missing data
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
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 8 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
« Prev « First page 1630 / 1723 Last » Next »