.png){kind=icon}
.png){kind=icon}
Return
A Unifying Framework for Mining Approximate Top-k Binary Patterns
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2013.181.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Mining methods and algorithms
0-1 data
approximate top-k patterns
communities in bipartite networks
MDL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W