Abstract
Mining top-k frequent closed itemsets was initially proposed and exactly solved by Wang et al. [IEEE Transactions on Knowledge and Data Engineering 17 (2005) 652-664]. However, in the literature, no research has ever considered the complexity of this problem. In this paper, we present a set of proofs showing that, in the general case, the problem of mining top-k frequent closed itemsets is not in APX. This indicates that heuristic algorithms rather than exact algorithms are preferred to solve the problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE T. Knowl. Data En. 17, 652–664 (2005)
Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-pattern Tree Approach. Data Min. Knowl. Disc. 8, 53–87 (2004)
Gunopulos, D., Khardon, R., Mannila, H., Saluja, S.: Discovering All Most Specific Sentences. ACM T. on Database Syst. 28, 140–174 (2003)
Zaki, M., Ogihara, M.: Theoretical foundations of association rules. In: Proceedings of Third SIGMOD 1998 Workshop on Research Issues in Data Mining and Knowledge Discovery, Seattle, USA, pp. 71–78 (1998)
Angiulli, F., Ianni, G., Palopoli, L.: On the Complexity of Inducing Categorical and Quantitative Association Rules. Theor. Comput. Sci. 314, 217–249 (2004)
Jermaine, C.: Finding the Most Interesting Correlations in a Database: How Hard Can it Be? Inform. Syst. 30, 21–46 (2005)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, C. (2006). Mining Top-K Frequent Closed Itemsets Is Not in APX. In: Ng, WK., Kitsuregawa, M., Li, J., Chang, K. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2006. Lecture Notes in Computer Science(), vol 3918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11731139_50
Download citation
DOI: https://doi.org/10.1007/11731139_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33206-0
Online ISBN: 978-3-540-33207-7
eBook Packages: Computer ScienceComputer Science (R0)