Sciweavers

2826 search results - page 491 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
16 years 3 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
TEI
2010
ACM
144views Hardware» more  TEI 2010»
16 years 1 months ago
Tangible jukebox: back to palpable music
Since commercial musical recordings became available about a century ago and until very recently, they had always been distributed by means of a physical support. Nowadays that re...
Daniel Gallardo, Sergi Jordà
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 10 days ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
PAKDD
2009
ACM
171views Data Mining» more  PAKDD 2009»
15 years 11 months ago
Detecting Abnormal Events via Hierarchical Dirichlet Processes
Abstract. Detecting abnormal event from video sequences is an important problem in computer vision and pattern recognition and a large number of algorithms have been devised to tac...
Xian-Xing Zhang, Hua Liu, Yang Gao, Derek Hao Hu
INAP
2001
Springer
15 years 10 months ago
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
Dennis P. Groth, Edward L. Robertson