Sciweavers

2497 search results - page 268 / 500
» A Partial-Repeatability Approach to Data Mining
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 7 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
PKDD
2007
Springer
143views Data Mining» more  PKDD 2007»
15 years 10 months ago
Using the Web to Reduce Data Sparseness in Pattern-Based Information Extraction
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
Sebastian Blohm, Philipp Cimiano
PKDD
2005
Springer
159views Data Mining» more  PKDD 2005»
15 years 10 months ago
Fast Burst Correlation of Financial Data
We examine the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. Our methodology is comprised of two steps: a burst dete...
Michail Vlachos, Kun-Lung Wu, Shyh-Kwei Chen, Phil...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
16 years 4 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
JIIS
2006
100views more  JIIS 2006»
15 years 4 months ago
Spatial associative classification: propositional vs structural approach
Spatial associative classification takes advantage of employing association rules for spatial classification purposes. In this work, we investigate spatial associative classificati...
Michelangelo Ceci, Annalisa Appice