423 search results - page 70 / 85 » An Efficient and Scalable Management of Ontology |
158
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
172
click to vote
GIS
2007
ACM
15 years 11 months ago
2007
ACM
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
KDD
2006
ACM
15 years 10 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...
KDD
2006
ACM
15 years 10 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...
KDD
2003
ACM
15 years 10 months ago
2003
ACM
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...