Sciweavers

2932 search results - page 279 / 587
» Higher order mining
Sort
View
KAIS
2008
114views more  KAIS 2008»
15 years 6 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
ICDM
2009
IEEE
145views Data Mining» more  ICDM 2009»
15 years 4 months ago
Significance of Episodes Based on Minimal Windows
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...
Nikolaj Tatti
PAKDD
2011
ACM
419views Data Mining» more  PAKDD 2011»
14 years 9 months ago
DISC: Data-Intensive Similarity Measure for Categorical Data
Abstract. The concept of similarity is fundamentally important in almost every scientific field. Clustering, distance-based outlier detection, classification, regression and sea...
Aditya Desai, Himanshu Singh, Vikram Pudi
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
13 years 9 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
ICPP
1999
IEEE
15 years 11 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward