Skip to main content
SpringerLink
Log in

Maximum-expectation integrated agglomerative nesting data mining model for cultural datasets

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

Cultural geo-information system (CGIS) database is mainly used to identify the location and date archeological objects in cultural data analysis. When using various data mining approaches during cultural data analysis in CGIS systems, cohesion and time complexity are considered as one of the major parameters which minimize the quality of patterns or objects in CGIS system. In the recent past, several researchers have looked for ways to minimize cohesion and time complexity caused in the area of CGIS, whereas in research maximum-expectation (MAX-EXP) integrated agglomerative nesting (MAX-EXP-AN) data mining model in the present system to address this issues which helps to minimize the cohesion present in the cluster using distance metrics. The time-complexity in identifying cultural objects in various geo-locations and dates of archeological objects effectively reduced using an optimized pairwise distance measurements technique with less cohesion and error. Furthermore, the experimental validation shows promising results with less errors, cohesion, and time complexity keeps the MAX-EXP-AN suitable for CGIS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Tolba A, Elashkar E (2018) “Soft computing approaches based bookmark selection and clustering techniques for social tagging systems.” Clust Comput 1–7. doi https://doi.org/10.1007/s10586-018-2014-5

    Article  Google Scholar 

  2. Rahim A, Ma K, Zhao W, Tolba A, Al-Makhadmeh Z, Xia F (2018) Cooperative data forwarding based on crowdsourcing in vehicular social networks. Pervasive Mob Comput 51:43–55

    Article  Google Scholar 

  3. Li J, Ning Z, Jedari B, Xia F, Lee I, Tolba A (2016) Geo-social distance-based data dissemination for socially aware networking. IEEE Access 4:1444–1453

    Article  Google Scholar 

  4. Bai X, Zhang F, Hou J, Xia F, Tolba A, Elashkar E (2017) Implicit multi-feature learning for dynamic time series prediction of the impact of institutions. IEEE Access 5:16372–16382

    Article  Google Scholar 

  5. Tolba A (2019) Content accessibility preference approach for improving service optimality in internet of vehicles. Comput Netw 152:78–86

    Article  Google Scholar 

  6. Preeth, S.K.S.L., Dhanalakshmi, R., Kumar, R.,Shakeel P M. An adaptive fuzzy rule based energy efficient clustering and immune-inspired routing protocol for WSN-assisted IoT system. J Ambient Intell Humaniz Comput 2018:1–13. doi https://doi.org/10.1007/s12652-018-1154-z

  7. Rahim A, Qiu T, Ning Z, Wang J, Ullah N, Tolba A, Xia F (2019) Social acquaintance based routing in vehicular social networks. Futur Gener Comput Syst 93:751–760

    Article  Google Scholar 

  8. Baskar S, Periyanayagi S, Shakeel PM, Dhulipala VS (2019) An energy persistent range-dependent regulated transmission communication model for vehicular network applications. Comput Netw 152:144–153. https://doi.org/10.1016/j.comnet.2019.01.027

    Article  Google Scholar 

  9. Wang J, Kong X, Rahim A, Xia F, Tolba A, Al-Makhadmeh Z (2017) IS2Fun: identification of subway station functions using massive urban data. IEEE Access 5:27103–27113

    Article  Google Scholar 

  10. Alarifi A, Tolba A (2019) Optimizing the network energy of cloud assisted internet of things by using the adaptive neural learning approach in wireless sensor networks. Comput Ind 106:133–141

    Article  Google Scholar 

  11. Bai X, Lee I, Ning Z, Tolba A, Xia F (2017) The role of positive and negative citations in scientific evaluation. IEEE Access 5:17607–17617

    Article  Google Scholar 

  12. AlFarraj O, AlZubi A, Tolba A (2018) Optimized feature selection algorithm based on fireflies with gravitational ant colony algorithm for big data predictive analytics. Neural Comput & Applic 31:1391–1403. https://doi.org/10.1007/s00521-018-3612-0

    Article  Google Scholar 

  13. Alarifi A, Tolba A, Al-Makhadmeh Z, Said W (2018) A big data approach to sentiment analysis using greedy feature selection with cat swarm optimization-based long short-term memory neural networks. J Supercomput. https://doi.org/10.1007/s11227-018-2398-2

  14. Xia F, Liaqat HB, Ahmed AM, Liu L, Ma J, Huang R, Tolba A (2016) User popularity-based packet scheduling for congestion control in ad-hoc social networks. J Comput Syst Sci 82(1):93–112

    Article  MathSciNet  Google Scholar 

  15. Shakeel PM, Burhanuddin MA, Desa MI (2019) Lung cancer detection from CT image using improved profuse clustering and deep learning instantaneously trained neural networks. Measurement 145:702–712. https://doi.org/10.1016/j.measurement.2019.05.027

    Article  Google Scholar 

  16. Canito A, Marreiros G, Corchado JM (2019) Automatic document annotation with data mining algorithms. In World conference on information systems and technologies. Springer, Cham, pp 68–76

    Google Scholar 

  17. Lei M, Wen B, Gan J, Wang J (2019) Clustering algorithm of ethnic cultural resources based on spark. Int J Perform Ability Eng 15(3):756–762

  18. Luo NC (2019) Massive data mining algorithm for web text based on clustering algorithm. J Adv Comput Intell Intell Inform 23(2):362–365

    Article  Google Scholar 

  19. Kempen R, Meier A, Hasche J, Mueller K (2019) Optimized multi-algorithm voting: increasing objectivity in clustering. Expert Syst Appl 118:217–230

    Article  Google Scholar 

  20. Rodriguez MZ, Comin CH, Casanova D, Bruno OM, Amancio DR, Costa LDF, Rodrigues FA (2019) Clustering algorithms: a comparative approach. PLoS One 14(1):e0210236

    Article  Google Scholar 

  21. Milovanović S, Bogdanović Z, Labus A, Barać D, Despotović-Zrakić M (2019) An approach to identify user preferences based on social network analysis. Futur Gener Comput Syst 93:121–129

    Article  Google Scholar 

  22. Mittal M, Goyal LM, Hemanth DJ, Sethi JK (2019) Clustering approaches for high-dimensional databases: a review. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 9(3):e1300. https://doi.org/10.1002/widm.1300

  23. Rasyid LA, Andayani S (2018) Review on clustering algorithms based on data type: towards the method for data combined of numeric-fuzzy linguistics. In Journal of Physics: Conference Series (Vol. 1097, No. 1). IOP Publishing, Bristol, pp 012082

  24. Woodley A, Tang LX, Geva S, Nayak R, Chappell T (2018) Parallel K-tree: a multicore, multinode solution to extreme clustering. Future Generation Computer Systems 99:333–345

    Article  Google Scholar 

  25. Matioli LC, Santos SR, Kleina M, Leite EA (2018) A new algorithm for clustering based on kernel density estimation. J Appl Stat 45(2):347–366

    Article  MathSciNet  Google Scholar 

  26. Zhu Y, Ting KM, Jin Y, Angelova M (2018) Hierarchical clustering that takes advantage of both density-peak and density-connectivity. arXiv preprint arXiv:1810.03393. https://arxiv.org/pdf/1810.03393.pdf. Accessed 26 June 2019

  27. Cheng D, Zhu Q, Huang J, Wu Q, Yang L (2018) A novel cluster validity index based on local cores. IEEE Trans Neural Netw Learn Syst 30(4):985–999

    Article  Google Scholar 

  28. Wang J, Zhu C, Zhou Y, Zhu X, Wang Y, Zhang W (2018) From partition-based clustering to density-based clustering: fast find clusters with diverse shapes and densities in spatial databases. IEEE Access 6:1718–1729

    Article  Google Scholar 

  29. MuhammedShafi P, Selvakumar S, Mohamed Shakeel P (2018) An efficient optimal fuzzy C means (OFCM) algorithm with particle swarm optimization (PSO) to analyze and predict crime data. J Adv Res Dyn Control Syst (Special Issue No 06):699–707

  30. Chowdhury K, Chaudhuri D, Pal AK (2018) A novel objective function based clustering with optimal number of clusters. In: Mandal J, Mukhopadhyay S, Dutta P, Dasgupta K (eds) Methodologies and application issues of contemporary computing framework. Springer, Singapore. https://doi.org/10.1007/978-981-13-2345-4_3

    Chapter  Google Scholar 

  31. Pełka M (2018) Analysis of innovations in the European Union via ensemble symbolic density clustering. Econometrics 22(3):84–98

    Article  Google Scholar 

  32. Dos Anjos FDAR, Gertrudes JC, Sander J, Campello RJ (2018) A modularity-based measure for cluster selection from clustering hierarchies. In Australasian conference on data mining. Springer, Singapore, pp 253–265

    Google Scholar 

  33. Zhang D, Lee K, Lee I (2018) Hierarchical trajectory clustering for spatio-temporal periodic pattern mining. Expert Syst Appl 92:1–11

    Article  Google Scholar 

  34. Lu J, Zhu Q, Wu Q (2018) A novel data clustering algorithm using heuristic rules based on k-nearest neighbors chain. Eng Appl Artif Intell 72:213–227

    Article  Google Scholar 

  35. Karim A, Loqman C, Boumhidi J (2018) Determining the number of clusters using neural network and max stable set problem. Procedia Comput Sci 127:16–25

    Article  Google Scholar 

  36. Shakeel PM, Baskar S, Dhulipala VS, Jaber MM (2018) Cloud based framework for diagnosis of diabetes mellitus using K-means clustering. Health Inf Sci Syst 6(1):16. https://doi.org/10.1007/s13755-018-0054-0

    Article  Google Scholar 

  37. Said O, Tolba A (2018) Design and performance evaluation of mixed multicast architecture for internet of things environment. J Supercomput 74:3295–3328

    Article  Google Scholar 

  38. Papanikolaou Y, Tsoumakas G, Katakis I (2018) Hierarchical partitioning of the output space in multi-label data. Data Knowl Eng 116:42–60

    Article  Google Scholar 

  39. Jedari B, Xia F, Chen H, Das SK, Tolba A, Al-Makhadmeh Z (2019) A social-based watchdog system to detect selfish nodes in opportunistic mobile networks. Futur Gener Comput Syst 92:777–788

    Article  Google Scholar 

  40. Ahmed AM, Kong X, Liu L, Xia F, Abolfazli S, Sanaei Z, Tolba A (2017) BoDMaS: bio-inspired selfishness detection and mitigation in data management for ad-hoc social networks. Ad Hoc Network 55:119–131

    Article  Google Scholar 

Download references

Funding

The authors extend their appreciation to the Deanship of Scientific Research at King Saud University for funding this work through Research Group No. RG-1440-078.

Author information

Authors and Affiliations

  1. Computer Science Department, Community College, King Saud University, Riyadh, 11437, Saudi Arabia

    Abdulaziz Alarifi & Ayed Alwadain

Authors
  1. Abdulaziz Alarifi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ayed Alwadain
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdulaziz Alarifi.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Alarifi, A., Alwadain, A. Maximum-expectation integrated agglomerative nesting data mining model for cultural datasets. Pers Ubiquit Comput 24, 45–55 (2020). https://doi.org/10.1007/s00779-019-01257-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-019-01257-6

Keywords

Search

Navigation