Sciweavers

12863 search results - page 971 / 2573
» Dynamic Data Mining
Sort
View
IPL
2007
101views more  IPL 2007»
15 years 7 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
CVPR
2011
IEEE
15 years 5 months ago
Dynamic Batch Mode Active Learning
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
Shayok Chakraborty, Vineeth Balasubramanian, Sethu...
KDD
2007
ACM
231views Data Mining» more  KDD 2007»
16 years 8 months ago
Xproj: a framework for projected structural clustering of xml documents
XML has become a popular method of data representation both on the web and in databases in recent years. One of the reasons for the popularity of XML has been its ability to encod...
Charu C. Aggarwal, Na Ta, Jianyong Wang, Jianhua F...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
15 years 9 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 9 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand