✦ LIBER ✦

An effective tree structure for mining high utility itemsets

✍ Scribed by Chun-Wei Lin; Tzung-Pei Hong; Wen-Hsiang Lu

Book ID: 108130679
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 405 KB
Volume: 38
Category: Article
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2010.12.082

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mining high utility itemsets by dynamica

Mining high utility itemsets by dynamically pruning the tree structure

✍ Song, Wei; Liu, Yu; Li, Jinhong 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 789 KB

An incremental mining algorithm for high

An incremental mining algorithm for high utility itemsets

✍ Chun-Wei Lin; Guo-Cheng Lan; Tzung-Pei Hong 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Array based HV/VH tree: an effective dat

Array based HV/VH tree: an effective data structure for layout representation

✍ Jie Ren; Wei-wei Pan; Yong-jun Zheng; Zheng Shi; Xiao-lang Yan 📂 Article 📅 2012 🏛 SP Zhejiang University Press 🌐 English ⚖ 475 KB

MKL-tree: an index structure for high-di

MKL-tree: an index structure for high-dimensional vector spaces

✍ Annalisa Franco; Alessandra Lumini; Dario Maio 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 611 KB

SR-tree: An index structure for nearest-

SR-tree: An index structure for nearest-neighbor searching of high-dimensional point data

✍ Norio Katayama; Shin'ichi Satoh 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB 👁 2 views

Similarity search methods using feature vectors are employed widely for implementation of content-based retrieval of visual data, and appropriate index structures were explored to accelerate the search. Methods proposed hitherto have used the R \* -tree and the SS-tree. This study offers a faster in

An automatic hexahedral mesh generation

An automatic hexahedral mesh generation for high-quality mesh by deformation and tree structure

✍ Noguchi, S.; Maeda, T.; Yamashita, K.; Yamashita, H.; Cingoski, V. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 302 KB