The Community for Technology Leaders
Green Image
ABSTRACT
A major mining task for binary matrixes is the extraction of approximate top-k patterns that are able to concisely describe the input data. The top-k pattern discovery problem is commonly stated as an optimization one, where the goal is to minimize a given cost function, see the accuracy of the data description. In this work, we review several greedy algorithms, and discuss PANDA+, an algorithmic framework able to optimize different cost functions generalized into a unifying formulation. We evaluated the goodness of the algorithm by measuring the quality of the extracted patterns. We adapted standard quality measures to assess the capability of the algorithm to discover both the items and transactions of the patterns embedded in the data. The evaluation was conducted on synthetic data, where patterns were artificially embedded, and on real-world text collection, where each document is labeled with a topic. Finally, in order to qualitatively evaluate the usefulness of the discovered patterns, we exploited PANDA+ to detect overlapping communities in a bipartite network. The results show that PANDA+ is able to discover high-quality patterns in both synthetic and real-world datasets.
INDEX TERMS
text analysis, data mining, greedy algorithms, minimisation,synthetic datasets, approximate top-k binary pattern mining, approximate top-k pattern extraction, binary matrixes, top-k pattern discovery problem, cost function minimization, data description, greedy algorithms, PANDA+, unifying formulation, synthetic data, real-world text collection, bipartite network,Cost function, Data mining, Approximation algorithms, Matrix decomposition, Encoding, Noise measurement,and association rules, Data mining, Clustering, classification,MDL, Mining methods and algorithms, 0-1 data, approximate top- $k$ patterns, communities in bipartite networks
CITATION
"A Unifying Framework for Mining Approximate Top- $k$ Binary Patterns", IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. , pp. 2900-2913, Dec. 2014, doi:10.1109/TKDE.2013.181
1563 ms
(Ver 3.3 (11022016))