{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:14:36Z","timestamp":1761808476396,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811675010"},{"type":"electronic","value":"9789811675027"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-7502-7_2","type":"book-chapter","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T09:06:55Z","timestamp":1635498415000},"page":"16-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hypergraph Ontology Sparse Vector Representation and Its Application to Ontology Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7044-4860","authenticated-orcid":false,"given":"Linli","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7963-3502","authenticated-orcid":false,"given":"Wei","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"101568","DOI":"10.1016\/j.is.2020.101568","volume":"93","author":"M Verdonck","year":"2020","unstructured":"Verdonck, M., Gailly, F., de Cesare, S.: Comprehending 3D and 4D ontology-driven conceptual models: An empirical study. Inf. Syst. 93, 101568 (2020)","journal-title":"Inf. Syst."},{"issue":"3\u20134","key":"2_CR2","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10846-019-01076-0","volume":"99","author":"H Azevedo","year":"2020","unstructured":"Azevedo, H., Belo, J.P.R., Romero, R.A.F.: Using ontology as a strategy for modeling the interface between the cognitive and robotic systems. J. Intell. Robot. Syst. 99(3\u20134), 431\u2013449 (2020). https:\/\/doi.org\/10.1007\/s10846-019-01076-0","journal-title":"J. Intell. Robot. Syst."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"104747","DOI":"10.1016\/j.ssci.2020.104747","volume":"129","author":"JI Single","year":"2020","unstructured":"Single, J.I., Schmidt, J., Denecke, J.: Knowledge acquisition from chemical accident databases using an ontology-based method and natural language processing. Saf. Sci. 129, 104747 (2020). UNSP","journal-title":"Saf. Sci."},{"issue":"15","key":"2_CR4","doi-asserted-by":"publisher","first-page":"e5315","DOI":"10.1002\/cpe.5315","volume":"32","author":"T Labidi","year":"2020","unstructured":"Labidi, T., Mtibaa, A., Gaaloul, W., et al.: Cloud SLA negotiation and re-negotiation: an ontology-based context-aware approach. Concurr. Comput. Pract. Experience 32(15), e5315 (2020)","journal-title":"Concurr. Comput. Pract. Experience"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"106050","DOI":"10.1016\/j.knosys.2020.106050","volume":"201","author":"ZM Lv","year":"2020","unstructured":"Lv, Z.M., Peng, R.: A novel meta-matching approach for ontology alignment using grasshopper optimization. Knowl. Based Syst. 201, 106050 (2020)","journal-title":"Knowl. Based Syst."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"105589","DOI":"10.1016\/j.compag.2020.105589","volume":"175","author":"S Aydin","year":"2020","unstructured":"Aydin, S., Aydin, M.N.: Ontology-based data acquisition model development for agricultural open data platforms and implementation of OWL2MVC tool. Comput. Electron. Agric. 175, 105589 (2020)","journal-title":"Comput. Electron. Agric."},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1002\/spe.2821","volume":"50","author":"DK Pattipati","year":"2020","unstructured":"Pattipati, D.K., Nasre, R., Puligundla, S.K.: OPAL: an extensible framework for ontology-based program analysis. Softw. Pract. Experience 50(8), 1425\u20131462 (2020)","journal-title":"Softw. Pract. Experience"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"100563","DOI":"10.1016\/j.websem.2020.100563","volume":"63","author":"A Annane","year":"2020","unstructured":"Annane, A., Bellahsene, Z.: GBKOM: a generic framework for BK-based ontology matching. J. Web Seman. 63, 100563 (2020)","journal-title":"J. Web Seman."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"101329","DOI":"10.1016\/j.smrv.2020.101329","volume":"52","author":"GJ Lammers","year":"2020","unstructured":"Lammers, G.J., Bassetti, C.L.A., Dauvilliers, Y.: Reply to Micoulaud-Franchi et al. Commentary on diagnosis of central disorders of hypersomnolence: from clinic to clinic via ontology and semantic analysis on a bullet point path. Sleep Med. Rev. 52, 101329 (2020). UNSP","journal-title":"Sleep Med. Rev."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.actaastro.2020.03.047","volume":"173","author":"M Jankovic","year":"2020","unstructured":"Jankovic, M., Yuksel, M., Babr, M.M., et al.: Space debris ontology for ADR capture methods selection. Acta Astronautica 173, 56\u201368 (2020)","journal-title":"Acta Astronautica"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1540034.","DOI":"10.1142\/S0218127415400349","volume":"25","author":"W Gao","year":"2015","unstructured":"Gao, W., Zhu, L., Wang, K.: Ontology sparse vector learning algorithm for ontology similarity measuring and ontology mapping via ADAL technology. Int. J. Bifurcat. Chaos 25, 1540034. (2015). https:\/\/doi.org\/10.1142\/S0218127415400349","journal-title":"Int. J. Bifurcat. Chaos"},{"issue":"9C10","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1080\/10236198.2018.1551383","volume":"25","author":"W Gao","year":"2019","unstructured":"Gao, W., Zhang, Y.Q., Guirao, J.L.G., et al.: A discrete dynamics approach to sparse calculation and applied in ontology science. J. Differ. Equ. Appl. 25(9C10), 1239\u20131254 (2019)","journal-title":"J. Differ. Equ. Appl."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ins.2018.07.049","volume":"467","author":"W Gao","year":"2018","unstructured":"Gao, W., Guirao, J.L.G., Basavanagoud, B., et al.: Partial multi-dividing ontology learning algorithm. Inf.. Sci. 467, 35\u201358 (2018)","journal-title":"Inf.. Sci."},{"key":"2_CR14","first-page":"1289","volume":"60","author":"W Gao","year":"2017","unstructured":"Gao, W., Farahani, M.R.: Generalization bounds and uniform bounds for multi-dividing ontology algorithms with convex ontology loss function. Comput. J. 60, 1289\u20131299 (2017)","journal-title":"Comput. J."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1186\/s13677-020-00173-y","volume":"9","author":"W Gao","year":"2020","unstructured":"Gao, W., Chen, Y.: Approximation analysis of ontology learning algorithm in linear combination setting. J. Cloud Comput. 9, 29 (2020). https:\/\/doi.org\/10.1186\/s13677-020-00173-y","journal-title":"J. Cloud Comput."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.jctb.2020.01.001","volume":"144","author":"P Frankl","year":"2020","unstructured":"Frankl, P.: Maximum degree and diversity in intersecting hypergraphs. J. Comb. Theory Ser. B 144, 81\u201394 (2020)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"103116","DOI":"10.1016\/j.ejc.2020.103116","volume":"88","author":"E Aigner-Horev","year":"2020","unstructured":"Aigner-Horev, E., Han, H.: Linear quasi-randomness of subsets of Abelian groups and hypergraphs. Eur. J. Comb. 88, 103116 (2020)","journal-title":"Eur. J. Comb."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"102047","DOI":"10.1016\/j.aam.2020.102047","volume":"119","author":"S Mukherjee","year":"2020","unstructured":"Mukherjee, S., Bhattacharya, B.B.: Replica symmetry in upper tails of mean-field hypergraphs. Adv. Appl. Math. 119, 102047 (2020)","journal-title":"Adv. Appl. Math."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s12190-020-01414-8","volume":"65","author":"K Gopal","year":"2020","unstructured":"Gopal, K., Gupta, M.K.: Bounds on generalized FR codes using hypergraphs. J. Appl. Math. Comput. 65, 771\u2013792 (2020). https:\/\/doi.org\/10.1007\/s12190-020-01414-8","journal-title":"J. Appl. Math. Comput."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"P3.12","DOI":"10.37236\/9019","volume":"27","author":"S Arunachalam","year":"2020","unstructured":"Arunachalam, S., Vrana, P., Zuiddam, J.: The asymptotic induced matching number of hypergraphs: balanced binary strings. Electron. J. Comb. 27(3), P3.12 (2020)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10474-020-01078-7","volume":"161","author":"J Polcyn","year":"2020","unstructured":"Polcyn, J., Reiher, C., Rodl, V., et al.: Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs. Acta Math. Hung. 161(2), 647\u2013699 (2020). https:\/\/doi.org\/10.1007\/s10474-020-01078-7","journal-title":"Acta Math. Hung."},{"key":"2_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-020-09701-7","author":"MA Javidian","year":"2020","unstructured":"Javidian, M.A., Wang, Z.Y., Lu, L.Y., et al.: On a hypergraph probabilistic graphical model. Ann. Math. Artif. Intell. (2020). https:\/\/doi.org\/10.1007\/s10472-020-09701-7","journal-title":"Ann. Math. Artif. Intell."},{"issue":"8","key":"2_CR23","doi-asserted-by":"publisher","first-page":"2582","DOI":"10.1007\/s10773-020-04527-9","volume":"59","author":"A Akhound","year":"2020","unstructured":"Akhound, A., Motlagh, M.A.C.: Evaluation of entanglement measures for hypergraph states up to four qubits. Int. J. Theor. Phys. 59(8), 2582\u20132588 (2020)","journal-title":"Int. J. Theor. Phys."},{"issue":"4","key":"2_CR24","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1002\/rsa.20912","volume":"56","author":"M Anastos","year":"2020","unstructured":"Anastos, M., Frieze, A.: On the connectivity of proper colorings of random graphs and hypergraphs. Random Struct. Algorithms 56(4), 988\u2013997 (2020)","journal-title":"Random Struct. Algorithms"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2020.03.011","volume":"821","author":"T Lidbetter","year":"2020","unstructured":"Lidbetter, T., Lin, K.Y.: A search game on a hypergraph with booby traps. Theor. Comput. Sci. 821, 57\u201370 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.laa.2020.03.007","volume":"596","author":"X Li","year":"2020","unstructured":"Li, X., Wang, J.: On the ABC spectra radius of unicyclic graphs. Linear Algebra Appl. 596, 71\u201381 (2020)","journal-title":"Linear Algebra Appl."},{"key":"2_CR27","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2020.1777250","author":"M Rezagholibeigi","year":"2020","unstructured":"Rezagholibeigi, M., Aalipour, G., Naghipour, A.R.: On the spectrum of the closed unit graphs. Linear Multilinear Algebra (2020). https:\/\/doi.org\/10.1080\/03081087.2020.1777250","journal-title":"Linear Multilinear Algebra"},{"issue":"7","key":"2_CR28","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s00023-020-00920-6","volume":"21","author":"D Damanik","year":"2020","unstructured":"Damanik, D., Fang, L.C., Sukhtaiev, S.: Zero measure and singular continuous spectra for quantum graphs. Ann. Henri Poincare 21(7), 2167\u20132191 (2020). https:\/\/doi.org\/10.1007\/s00023-020-00920-6","journal-title":"Ann. Henri Poincare"},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/s00029-019-0487-6","volume":"25","author":"V Chousionis","year":"2019","unstructured":"Chousionis, V., Leykekhman, D., Urbanski, M.: The dimension spectrum of conformal graph directed Markov systems. Sel. Math. New Ser. 25(3), 40 (2019). UNSP","journal-title":"Sel. Math. New Ser."},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s40840-017-0566-9","volume":"42","author":"G Tian","year":"2019","unstructured":"Tian, G., He, J., Cui, S.: On the Laplacian spectra of some double join operations of graphs. Bull. Malays. Math. Sci. Soc. 42(4), 1555\u20131566 (2019)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.dam.2018.12.009","volume":"263","author":"D Orden","year":"2019","unstructured":"Orden, D., Marsa-Maestre, I., Gimenez-Guzman, J.M., et al.: Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction. Discrete Appl. Math. 263, 234\u2013243 (2019)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2_CR32","first-page":"227","volume":"26","author":"M Afkhami","year":"2019","unstructured":"Afkhami, M., Hassankhani, M., Khashyarmanesh, K.: Distance between the spectra of graphs with respect to normalized Laplacian spectra. Ge. Math. J. 26(2), 227\u2013234 (2019)","journal-title":"Ge. Math. J."},{"issue":"6","key":"2_CR33","doi-asserted-by":"publisher","first-page":"3778","DOI":"10.1109\/TIT.2019.2895356","volume":"65","author":"A Dehghan","year":"2019","unstructured":"Dehghan, A., Banihashemi, A.H.: On computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph. IEEE Trans. Inf. Theory 65(6), 3778\u20133789 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"2_CR34","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s11785-018-0817-2","volume":"13","author":"C Anne","year":"2019","unstructured":"Anne, C., Balti, M., Torki-Hamza, N.: Sectoriality and essential spectrum of non symmetric graph Laplacians. Complex Anal. Oper. Theory 13(3), 967\u2013983 (2019). https:\/\/doi.org\/10.1007\/s11785-018-0817-2","journal-title":"Complex Anal. Oper. Theory"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1214\/19-EJP305","volume":"24","author":"PL Meliot","year":"2019","unstructured":"Meliot, P.L.: Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group. Electron. J. Probab. 24, 43 (2019)","journal-title":"Electron. J. Probab."}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-7502-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T09:09:36Z","timestamp":1635498576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-7502-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811675010","9789811675027"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-7502-7_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/dmbd2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"258","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}