Abstract
Minimal jumping emerging patterns have been proved very useful for classification purposes. Nevertheless, the determination of minimal jumping emerging patterns may require evaluation of candidate patterns, the number of which might be exponential with respect to the dimensionality of a data set. This property may disallow classification by means of minimal jumping emerging patterns in the case of high dimensional data. In this paper, we derive an upper bound on the lengths of minimal jumping emerging patterns and an upper bound on their number. We also propose an alternative approach to lazy classification which uses explicit contrast patterns instead of minimal jumping emerging patterns, but produces the same classification quality as a lazy classifier based on minimal jumping emerging patterns. We argue that our approach, unlike the approach based on minimal jumping emerging patterns, can be applied in the case of high dimensional data.
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 subscriptionsReferences
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)
Bailey, J., Ramamohanarao, K.: Mining emerging patterns using tree structures or tree based searches. In: Contrast Data Mining: Concepts, Algorithms, and Applications. Taylor & Francis Group LLC, Boca Raton (2013)
Dong, G., Li, J., Zhang, X.: Discovering jumping emerging patterns and experiments on real datasets. In: IDC 1999 (1999)
Fan, H., Kotagiri, R.: An efficient single-scan algorithm for mining essential jumping emerging patterns for classification. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 456–462. Springer, Heidelberg (2002)
Kryszkiewicz, M.: Concise representation of frequent patterns based on disjunction-free generators. In: Proceedings of ICDM 2001, pp. 305–312. IEEE Computer Society (2001)
Kryszkiewicz, M.: Concise representations of frequent patterns and association rules. Prace Naukowe Politechniki Warszawskiej. Elektronika 142 (2002)
Kryszkiewicz M.: Using generators for discovering certain and generalized decision. In: HIS 2005, pp. 181–186 (2005)
Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. In: PAKDD 2000, pp. 220–232 (2000)
Jinyan, L., Guozhu, D., Kotagiri, R., Limsoon, W.: DeEPs: a new instance-based lazy discovery and classification system. ML 54(2), 99–124 (2004)
Skowron A.: Boolean reasoning for decision rules generation. In: ISMIS 1993, pp. 295–305 (1993)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Fast computation of concept lattices using data mining techniques. Proc. KRDB 2000, 129–139 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kryszkiewicz, M., Podsiadly, P. (2016). Explicit Contrast Patterns Versus Minimal Jumping Emerging Patterns for Lazy Classification in High Dimensional Data. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds) Trends in Applied Knowledge-Based Systems and Data Science. IEA/AIE 2016. Lecture Notes in Computer Science(), vol 9799. Springer, Cham. https://doi.org/10.1007/978-3-319-42007-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-42007-3_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42006-6
Online ISBN: 978-3-319-42007-3
eBook Packages: Computer ScienceComputer Science (R0)