Sciweavers

164 search results - page 20 / 33
» Finding Frequent Patterns in a Large Sparse Graph
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
82
Voted
ICDCS
2000
IEEE
15 years 1 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
15 years 10 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
97
Voted
INFOVIS
2000
IEEE
15 years 1 months ago
Visualizing Sequential Patterns for Text Mining
A sequential pattern in data mining is a finite series of elements such as A → B → C → D where A, B, C, and D are elements of the same domain. The mining of sequential patte...
Pak Chung Wong, Wendy Cowley, Harlan Foote, Elizab...
112
Voted
KDD
2009
ACM
221views Data Mining» more  KDD 2009»
15 years 10 months ago
Migration motif: a spatial - temporal pattern mining approach for financial markets
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee,...