{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:15:12Z","timestamp":1726060512410},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36683-4_1","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:08:15Z","timestamp":1574788095000},"page":"3-14","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing the Hypergraph-of-Entity Representation Model"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Devezas","sequence":"first","affiliation":[]},{"given":"S\u00e9rgio","family":"Nunes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"e0205497","DOI":"10.1371\/journal.pone.0205497","volume":"13","author":"D Aparicio","year":"2018","unstructured":"Aparicio, D., Ribeiro, P., Silva, F.: Graphlet-orbit transitions (got): a fingerprint for temporal network comparison. PLoS One 13, e0205497 (2018)","journal-title":"PLoS One"},{"unstructured":"Backstrom, L., Boldi, P., Rosa, M., Ugander, J., Vigna, S.: Four degrees of separation. CoRR abs\/1111.4570 (2011). \nhttp:\/\/arxiv.org\/abs\/1111.4570","key":"1_CR2"},{"doi-asserted-by":"publisher","unstructured":"Bast, H., Buchhold, B.: An index for efficient semantic full-text search. In: Proceedings of the 22nd ACM International Conference on Conference on Information and Knowledge Management, pp. 369\u2013378 (2013). \nhttps:\/\/doi.org\/10.1145\/2505515.2505689","key":"1_CR3","DOI":"10.1145\/2505515.2505689"},{"issue":"2\u20133","key":"1_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1561\/1500000032","volume":"10","author":"H Bast","year":"2016","unstructured":"Bast, H., Buchhold, B., Haussmann, E., et al.: Semantic search on text and knowledge bases. Found. Trends\u00ae Inf. Retrieval 10(2\u20133), 119\u2013271 (2016)","journal-title":"Found. Trends\u00ae Inf. Retrieval"},{"unstructured":"Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks. In: Proceedings of the Third International Conference on Weblogs and Social Media, ICWSM 2009, San Jose, California, USA, 17-20 May 2009 (2009). \nhttp:\/\/aaai.org\/ocs\/index.php\/ICWSM\/09\/paper\/view\/154","key":"1_CR5"},{"key":"1_CR6","volume-title":"Graphes et hypergraphes","author":"C Berge","year":"1970","unstructured":"Berge, C.: Graphes et hypergraphes. Dunod, Paris (1970)"},{"doi-asserted-by":"crossref","unstructured":"Bhagdev, R., Chapman, S., Ciravegna, F., Lanfranchi, V., Petrelli, D.: Hybrid search: Effectively combining keywords and semantic searches. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) European Semantic Web Conference, pp. 554\u2013568. Springer, Berlin (2008)","key":"1_CR7","DOI":"10.1007\/978-3-540-68234-9_41"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/3-540-45848-4_59","volume-title":"Graph Drawing","author":"Ulrik Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Herman, I., Himsolt, M., Marshall, M.S.: Graphml progress report structural layer proposal. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) International Symposium on Graph Drawing, pp. 501\u2013512. Springer, Berlin (2001)"},{"issue":"5","key":"1_CR9","first-page":"1","volume":"1695","author":"G Csardi","year":"2006","unstructured":"Csardi, G., Nepusz, T., et al.: The igraph software package for complex network research. InterJ. Complex Syst. 1695(5), 1\u20139 (2006)","journal-title":"InterJ. Complex Syst."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1515\/comp-2019-0006","volume":"9","author":"J Devezas","year":"2019","unstructured":"Devezas, J., Nunes, S.: Hypergraph-of-entity: a unified representation model for the retrieval of text and knowledge. Open Comput. Sci. 9(1), 103\u2013127 (2019). \nhttps:\/\/doi.org\/10.1515\/comp-2019-0006","journal-title":"Open Comput. Sci."},{"unstructured":"Estrada, E., Rodriguez-Velazquez, J.A.: Complex networks as hypergraphs. arXiv preprint physics\/0505137 (2005)","key":"1_CR11"},{"key":"1_CR12","first-page":"1","volume":"1","author":"JD Fern\u00e1ndez","year":"2016","unstructured":"Fern\u00e1ndez, J.D., Mart\u00ednez-Prieto, M.A., de la Fuente Redondo, P., Guti\u00e9rrez, C.: Characterizing RDF datasets. J. Inf. Sci. 1, 1\u201327 (2016)","journal-title":"J. Inf. Sci."},{"doi-asserted-by":"publisher","unstructured":"Gallagher, S.R., Goldberg, D.S.: Clustering coefficients in protein interaction hypernetworks. In: ACM Conference on Bioinformatics, Computational Biology and Biomedical Informatics, ACM-BCB 2013, Washington, DC, USA, 22-25 September 2013, p. 552 (2013). \nhttps:\/\/doi.org\/10.1145\/2506583.2506635","key":"1_CR13","DOI":"10.1145\/2506583.2506635"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13489-0_18","volume-title":"Lecture Notes in Computer Science","author":"Weiyi Ge","year":"2010","unstructured":"Ge, W., Chen, J., Hu, W., Qu, Y.: Object link structure in the semantic web. In: The Semantic Web: Research and Applications, 7th Extended Semantic Web Conference, ESWC 2010, Heraklion, Crete, Greece, May 30 - June 3 2010, Proceedings, Part II, pp. 257\u2013271 (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13489-0_18"},{"issue":"1\u20132","key":"1_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.2478\/v10248-012-0011-5","volume":"17","author":"M G\u0142\u0105bowski","year":"2012","unstructured":"G\u0142\u0105bowski, M., Musznicki, B., Nowak, P., Zwierzykowski, P.: Shortest path problem solving based on ant colony optimization metaheuristic. Image Process. Commun. 17(1\u20132), 7\u201317 (2012)","journal-title":"Image Process. Commun."},{"unstructured":"Halpin, H.: A query-driven characterization of linked data. In: Proceedings of the WWW2009 Workshop on Linked Data on the Web, LDOW 2009, Madrid, Spain, 20 April 2009. \nhttp:\/\/ceur-ws.org\/Vol-538\/ldow2009_paper16.pdf","key":"1_CR16"},{"unstructured":"Himsolt, M.: GML: A portable graph file format. Technical report, Universit\u00e4t Passau (1997)","key":"1_CR17"},{"issue":"5","key":"1_CR18","doi-asserted-by":"publisher","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S., Haus, U., Theis, F.J.: Hypergraphs and cellular networks. PLoS Comput. Biol. 5(5), e1000385 (2009). \nhttps:\/\/doi.org\/10.1371\/journal.pcbi.1000385","journal-title":"PLoS Comput. Biol."},{"unstructured":"Li, D.: Shortest paths through a reinforced random walk. Tech. rep., University of Uppsala (2011)","key":"1_CR19"},{"issue":"6","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.jcta.2006.11.006","volume":"114","author":"D Mubayi","year":"2007","unstructured":"Mubayi, D., Zhao, Y.: Co-degree density of hypergraphs. J. Comb. Theory, Ser. A 114(6), 1118\u20131132 (2007). \nhttps:\/\/doi.org\/10.1016\/j.jcta.2006.11.006","journal-title":"J. Comb. Theory, Ser. A"},{"unstructured":"Ouvrard, X., Goff, J.L., Marchand-Maillet, S.: Adjacency and tensor representation in general hypergraphs part 1: e-adjacency tensor uniformisation using homogeneous polynomials. CoRR abs\/1712.08189 (2017). \nhttp:\/\/arxiv.org\/abs\/1712.08189","key":"1_CR21"},{"doi-asserted-by":"publisher","unstructured":"Ribeiro, B.F., Basu, P., Towsley, D.: Multiple random walks to uncover short paths in power law networks. In: 2012 Proceedings IEEE INFOCOM Workshops, Orlando, FL, USA, 25-30 March 2012, pp. 250\u2013255 (2012). \nhttps:\/\/doi.org\/10.1109\/INFCOMW.2012.6193500","key":"1_CR22","DOI":"10.1109\/INFCOMW.2012.6193500"},{"doi-asserted-by":"publisher","unstructured":"Voorhees, E.M.: The efficiency of inverted index and cluster searches. In: SIGIR 1986, Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Pisa, Italy, 8-10 September 1986, pp. 164\u2013174 (1986). \nhttps:\/\/doi.org\/10.1145\/253168.253203","key":"1_CR23","DOI":"10.1145\/253168.253203"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"4860531:1","DOI":"10.1155\/2018\/4860531","volume":"2018","author":"W Yu","year":"2018","unstructured":"Yu, W., Sun, N.: Establishment and analysis of the supernetwork model for nanjing metro transportation system. Complexity 2018, 4860531:1\u20134860531:11 (2018). \nhttps:\/\/doi.org\/10.1155\/2018\/4860531","journal-title":"Complexity"},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/296854.277632","volume":"23","author":"J Zobel","year":"1998","unstructured":"Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted files versus signature files for text indexing. ACM Trans. Database Syst. 23(4), 453\u2013490 (1998). \nhttps:\/\/doi.org\/10.1145\/296854.277632","journal-title":"ACM Trans. Database Syst."}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36683-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:08:33Z","timestamp":1574788113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}