Sciweavers

627 search results - page 32 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
EDBT
2008
ACM
99views Database» more  EDBT 2008»
16 years 6 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
15 years 10 months ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
16 years 6 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
16 years 7 months ago
Indexing Uncertain Categorical Data
Uncertainty in categorical data is commonplace in many applications, including data cleaning, database integration, and biological annotation. In such domains, the correct value o...
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, R...
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 10 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth