Abstract
Inference on the still growing amount of data is a challenging problem that must be solved to operate efficiently and mine Big Data sources successfully and in a sensible time. This paper introduces a new inference method based on associative recalling of data and their relationships stored in associative graph data structures (AGDS) used for pattern matching for given criteria. These structures represent a richer set of relationships than popular tabular structures do because of their natural limitations. They recall relationships and related data faster than the time-consuming search algorithms based on many loops and conditions on tabular structures. It explains why brain processes trigger information so quickly, outperforming solution based on the Turing Machine and contemporary fast processors. The presented associative inference can work in constant time thanks to the specific data organization, access and direct representation of more relationships in AGDS structures than in the commonly used tabular structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, Santiago, Chile, pp. 487–499 (1994)
Altman, N.S.: An introduction to Kernel and nearest-neighbor nonparametric regression. Am. Stat. 46(3), 175–185 (1992)
Barwise, J., Etchemendy, J.: Language, Proof and Logic. CSLI Publications, Stanford (2008)
Berry, M.J.A., Linoff, G.S.: Data Mining Techniques, 2nd edn. Wiley Publishing Inc., Hoboken (2004)
Cormen, T., Leiserson, Ch., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn, pp. 484–504. MIT Press, Cambridge and McGraw-Hill, New York (2009)
Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016)
Horzyk, A.: Artificial Associative Systems and Associative Artificial Intelligence, pp. 108–111. Academic Publishing House EXIT, Warsaw (2013)
Horzyk, A.: Associative graph data structures with an efficient access via AVB+trees. In: 2018 11th International Conference on Human System Interaction (HSI), pp. 169–175. IEEE Xplore (2018)
Horzyk, A., Gołdon, K.: Associative graph data structures used for acceleration of k nearest neighbor classifiers. In: Kůrková, V., Manolopoulos, Y., Hammer, B., Iliadis, L., Maglogiannis, I. (eds.) ICANN 2018. LNCS, vol. 11139, pp. 648–658. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01418-6_64
Horzyk, A.: Neurons can sort data efficiently. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds.) ICAISC 2017. LNCS (LNAI), vol. 10245, pp. 64–74. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59063-9_6
Kalat, J.W.: Biological Grounds of Psychology, 10th edn. Wadsworth Publishing, Belmont (2008)
Kohonen, T.: Self-Organization and Associative Memory, vol. 8. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-88163-3
Larose, D.T.: Discovering knowledge from data. In: Introduction to Data Mining. PWN, Warsaw (2006)
Rutkowski, L.: Techniques and Methods of Artificial Intelligence. PWN, Warsaw (2012)
Tadeusiewicz, R., Korbicz, J., Rutkowski, L., Duch, W. (eds.): Biomedical Engineering. Basics and Applications. Neural Networks in Biomedical Engineering, vol. 9. EXIT, Warsaw (2013)
Acknowledgments
This work was supported by AGH 11.11.120.612.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Horzyk, A., Czajkowska, A. (2019). Associative Pattern Matching and Inference Using Associative Graph Data Structures. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2019. Lecture Notes in Computer Science(), vol 11509. Springer, Cham. https://doi.org/10.1007/978-3-030-20915-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-030-20915-5_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20914-8
Online ISBN: 978-3-030-20915-5
eBook Packages: Computer ScienceComputer Science (R0)