Sciweavers

5054 search results - page 703 / 1011
» Semantic Web Mining
Sort
View
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 7 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
16 years 1 months ago
Disk Aware Discord Discovery: Finding Unusual Time Series in Terabyte Sized Datasets
The problem of finding unusual time series has recently attracted much attention, and several promising methods are now in the literature. However, virtually all proposed methods...
Dragomir Yankov, Eamonn J. Keogh, Umaa Rebbapragad...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
16 years 1 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
SDM
2008
SIAM
119views Data Mining» more  SDM 2008»
15 years 8 months ago
An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
Kanishka Bhaduri, Hillol Kargupta
184
Voted
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
15 years 4 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...