✦ LIBER ✦

Efficient Mining of Frequent Closed XML Query Pattern

✍ Scribed by Jian-Hua Feng; Qian Qian; Jian-Yong Wang; Li-Zhu Zhou

Publisher: Springer
Year: 2007
Tongue: English
Weight: 547 KB
Volume: 22
Category: Article
ISSN: 1000-9000
DOI: 10.1007/s11390-007-9081-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast discovering frequent patterns for i

Fast discovering frequent patterns for incremental XML queries

✍ Peng Dun-lu; Qiu Yang 📂 Article 📅 2004 🏛 Wuhan University 🌐 English ⚖ 929 KB

Constructing projection frequent pattern

Constructing projection frequent pattern tree for efficient mining

✍ Xiang Jian-wen; He Yan-xiang; Kokichi Futatsugi; Kong Wei-qiang 📂 Article 📅 2003 🏛 Wuhan University 🌐 English ⚖ 681 KB

Mining lossless closed frequent patterns

Mining lossless closed frequent patterns with weight constraints

✍ Unil Yun 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Efficient breadth-first mining of freque

Efficient breadth-first mining of frequent pattern with monotone constraints

✍ Francesco Bonchi; Fosca Giannotti; Alessio Mazzanti; Dino Pedreschi 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 987 KB

Efficient preprocessing of XML queries u

Efficient preprocessing of XML queries using structured signatures

✍ Yon Dohn Chung; Jong Wook Kim; Myoung Ho Kim 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 136 KB

The paper proposes a preprocessing scheme for efficient processing of XML queries in XML-based information retrieval systems. For the preprocessing, we use a signature-based approach. In the conventional (flat document-based) information retrieval systems, user queries consist of keywords and boolea

An efficient hybrid algorithm for mining

An efficient hybrid algorithm for mining Web frequent access patterns

✍ Zhang Li-qiang; Liu Da-xin 📂 Article 📅 2004 🏛 Wuhan University 🌐 English ⚖ 355 KB