376 search results - page 25 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
PAKDD
2004
ACM
14 years 1 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
1 To achieve more efficient video indexing and access, we introduce a video database management framework and strategies for video content structure and events mining. The video sh...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...