Abstract
Due to the large amount of data stored in current information systems, new strategies are required in order to extract useful information from databases. Hereupon, data summarization is an interesting process that allows reducing a large database maintaining just the relevant parts of the whole collection. In this study, we propose a new approach for data summarization based on a recently proposed tourist walk diversification method. This approach allows setting two ways of selecting elements considering density and hyper volume of each class. In order to evaluate the proposed approach, we compared it with two known methods of the literature considering one real world dataset and one artificial dataset. The artificial dataset was created considering different data distribution aspects. The conducted experiments outcomes demonstrate that our proposed data summarization approach is a promising alternative for addressing the problem of selecting elements from large databases considering different aspects of distribution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Zins, C.: Conceptual approaches for defining data, information, and knowledge. J. Am. Soc. Inf. Sci. Technol. 58(4), 479–493 (2007)
Hoplaros, D., Tari, Z., Khalil, I.: Data summarization for network traffic monitoring. J. Netw. Comput. Appl. 37, 194–205 (2014)
Hu, Y., Chiu, D.M., Lui, J.: Entropy based adaptive flow aggregation. IEEE/ACM Trans. Netw. (TON) 17(3), 698–711 (2009)
Yu, L., Ren, F.: A study on cross-language text summarization using supervised methods. In: 2009 International Conference on Natural Language Processing and Knowledge Engineering, pp. 1–7. IEEE (2009)
Zhu, R.: Intelligent rate control for supporting real-time traffic in WLAN mesh networks. J. Netw. Comput. Appl. 34(5), 1449–1458 (2011)
Yager, R.R.: A new approach to the summarization of data. Inf. Sci. 28(1), 69–86 (1982)
Ahmed, M., Mahmood, A.N., Hu, J.: A survey of network anomaly detection techniques. J. Netw. Comput. Appl. 60, 19–31 (2016)
Ahmed, M.: Data summarization: a survey. Knowl. Inf. Syst. 58(2), 249–273 (2019)
Kinouchi, O., Martinez, A.S., Lima, G.F., Lourenço, G.M., Risau-Gusman, S.: Deterministic walks in random networks: an application to thesaurus graphs. Phys. A Stat. Mech. Appl. 315(3–4), 665–676 (2002)
Bunimovich, L.A.: Deterministic walks in random environments. Phys. D Nonlinear Phenom. 187(1–4), 20–29 (2004)
Lima, G.F., Martinez, A.S., Kinouchi, O.: Deterministic walks in random media. Phys. Rev. Lett. 87(1), 010603 (2001)
Terçariol, C.A.S., Martinez, A.S.: Analytical results for the statistical distribution related to a memoryless deterministic walk: dimensionality effect and mean-field models. Phys. Rev. E 72(2), 021103 (2005)
Stanley, H.E., Buldyrev, S.V.: Statistical physics: the salesman and the tourist. Nature 413(6854), 373 (2001)
Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k-center clustering for data summarization. arXiv preprint arXiv:1901.08628 (2019)
Ahmed, M.: Intelligent big data summarization for rare anomaly detection. IEEE Access 7, 68669–68677 (2019)
Shou, Z., Li, S.: Large dataset summarization with automatic parameter optimization and parallel processing for local outlier detection. Concurr. Comput. Pract. Exp. 30(23), e4466 (2018)
Celis, L.E., Keswani, V., Straszak, D., Deshpande, A., Kathuria, T., Vishnoi, N.K.: Fair and diverse DPP-based data summarization. arXiv preprint arXiv:1802.04023 (2018)
Fernandes, S., Fanaee-T, H., Gama, J.: Dynamic graph summarization: a tensor decomposition approach. Data Min. Knowl. Discov. 32(5), 1397–1420 (2018)
Tsalouchidou, I., Bonchi, F., Morales, G.D.F., Baeza-Yates, R.: Scalable dynamic graph summarization. IEEE Trans. Knowl. Data Eng. 32(2), 360–373 (2018)
Shah, N., Koutra, D., Zou, T., Gallagher, B. and Faloutsos, C.: Timecrunch: interpretable dynamic graph summarization. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1055–1064. ACM (2015)
Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 157–168. ACM (2012)
Hernández, C., Navarro, G.: Compression of web and social graphs supporting neighbor and community queries. In: Proceedings 5th ACM Workshop on Social Network Mining and Analysis (SNA-KDD). ACM (2011)
Oliva, S.Z., Felipe, J.C., Ribeiro, M.X.: Deterministic tourist walk for effective diversification of query results. In: 16th International Conference on Applied Computing (AC 2019), Cagliari. Proceedings of the 16th International Conference on Applied Computing, pp. 163–170 (2019)
Acknowledgments
This study was financed in part by the Coordination for the Improvement of Higher Education Personnel (CAPES) - Finance Code 001.
And Grant #2016/17078-0, São Paulo Research Foundation (FAPESP).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Oliva, S.Z., Felipe, J.C. (2020). Walk-Based Diversification for Data Summarization. In: Rocha, Á., Ferrás, C., Montenegro Marin, C., Medina García, V. (eds) Information Technology and Systems. ICITS 2020. Advances in Intelligent Systems and Computing, vol 1137. Springer, Cham. https://doi.org/10.1007/978-3-030-40690-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-40690-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-40689-9
Online ISBN: 978-3-030-40690-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)