14515 search results - page 2515 / 2903 » Efficient Embedded Computing |
164
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
171
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
203
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
182
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
171
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...