44 search results - page 8 / 9 » A probability analysis for candidate-based frequent itemset ... |
KDD
2003
ACM
14 years 5 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
KAIS
2011
13 years 7 days ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
GLOBECOM
2009
IEEE
14 years 19 hour ago
2009
IEEE
Abstract—Delay Tolerant Networks (DTNs) are wireless networks in which at any given time instance, the probability of having a complete path from a source to destination is low d...
TALG
2008
13 years 5 months ago
2008
Given a set of n elements, each of which is colored one of c 2 colors, we must determine an element of the plurality (most frequently occurring) color by pairwise equal/unequal co...
ICCV
1999
IEEE
14 years 7 months ago
1999
IEEE
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...