376 search results - page 62 / 76 » Efficient Indexing Structures for Mining Frequent Patterns |
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
IWCIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
DOCENG
2003
ACM
14 years 1 months ago
2003
ACM
Since the XML format became a de facto standard for structured documents, the IT research and industry have developed a number of XML editors to help users produce structured docu...