Sciweavers

732 search results - page 108 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 6 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
BNCOD
2007
160views Database» more  BNCOD 2007»
13 years 9 months ago
Parameterized XPath Views
: We present a new approach for accelerating the execution of XPath expressions using parameterized materialized XPath views (PXV). While the approach is generic we show how it can...
Timo Böhme, Erhard Rahm
WWW
2003
ACM
14 years 8 months ago
Mining newsgroups using networks arising from social behavior
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
Rakesh Agrawal, Sridhar Rajagopalan, Ramakrishnan ...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong