Sciweavers

252 search results - page 16 / 51
» Mining Frequent Patterns without Candidate Generation
Sort
View
INAP
2001
Springer
14 years 9 days 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
GIS
2004
ACM
14 years 9 months ago
A partial join approach for mining co-location patterns
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
Jin Soung Yoo, Shashi Shekhar
ADMA
2010
Springer
264views Data Mining» more  ADMA 2010»
13 years 6 months ago
Frequent Pattern Trend Analysis in Social Networks
Abstract. This paper describes an approach to identifying and comparing frequent pattern trends in social networks. A frequent pattern trend is defined as a sequence of time-stampe...
Puteri N. E. Nohuddin, Rob Christley, Frans Coenen...
ADMA
2008
Springer
87views Data Mining» more  ADMA 2008»
13 years 10 months ago
Negative Generator Border for Effective Pattern Maintenance
In this paper, we study the maintenance of frequent patterns in the context of the generator representation. The generator representation is a concise and lossless representation o...
Mengling Feng, Jinyan Li, Limsoon Wong, Yap-Peng T...
GIS
2008
ACM
14 years 9 months ago
Density based co-location pattern discovery
Co-location pattern discovery is to find classes of spatial objects that are frequently located together. For example, if two categories of businesses often locate together, they ...
Xiangye Xiao, Xing Xie, Qiong Luo, Wei-Ying Ma