{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:34:46Z","timestamp":1754156086572,"version":"3.41.2"},"reference-count":31,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2014,4,14]],"date-time":"2014-04-14T00:00:00Z","timestamp":1397433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,14]]},"abstract":"\n Purpose<\/jats:title>\n \u2013 In this work, a new general framework is proposed to guide navigation over a collaborative concept network, in order to discover paths between concepts. Finding semantic chains between concepts over a semantic network is an issue of great interest for many applications, such as explanation generation and query expansion. Collaborative concept networks over the web tend to have features such as large dimensions, high connectivity degree, dynamically evolution over the time, which represent special challenges for efficient graph search methods, since they result in huge memory requirements, high branching factors, unknown dimensions and high cost for accessing nodes. The paper aims to discuss these issues. <\/jats:p>\n <\/jats:sec>\n \n Design\/methodology\/approach<\/jats:title>\n \u2013 The proposed framework is based on the novel notion of heuristic semantic walk (HSW). In the HSW framework, a semantic proximity measure among concepts, reflecting the collective knowledge embedded in search engines or other statistical sources, is used as a heuristic in order to guide the search in the collaborative network. Different search strategies, information sources and proximity measures, can be used to adapt HSW to the collaborative semantic network under consideration. <\/jats:p>\n <\/jats:sec>\n \n Findings<\/jats:title>\n \u2013 Experiments held on the Wikipedia network and Bing search engine on a range of different semantic measures show that the proposed HSW approach with weighted randomized walk strategy outperforms state-of-the-art search methods. <\/jats:p>\n <\/jats:sec>\n \n Originality\/value<\/jats:title>\n \u2013 To the best of the authors' knowledge, the proposed HSW model is the first approach which uses search engine-based proximity measures as heuristic for semantic search.<\/jats:p>\n <\/jats:sec>","DOI":"10.1108\/ijwis-11-2013-0031","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T06:54:26Z","timestamp":1396421666000},"page":"85-103","source":"Crossref","is-referenced-by-count":26,"title":["Heuristic semantic walk for concept chaining in collaborative networks"],"prefix":"10.1108","volume":"10","author":[{"given":"Valentina","family":"Franzoni","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Milani","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2021010219524479000_b2","doi-asserted-by":"crossref","unstructured":"Bollegala, D.\n , \n Matsuo, Y.\n and \n Ishizukain, M.\n (2011), \u201cA web search engine-based approach to measure semantic similarity between words\u201d, IEEE Transactions on Knowledge and Data Engineering, Vol. 23 No. 7, pp. 977-990.","DOI":"10.1109\/TKDE.2010.172"},{"key":"key2021010219524479000_b16","doi-asserted-by":"crossref","unstructured":"Cao, G.\n , \n Gao, J.\n , \n Nie, J.Y.\n and \n Bai, J.\n (2007), \u201cExtending query translation to cross-language query expansion with Markov chain models\u201d, Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management (CIKM'07), ACM, New York, NY.","DOI":"10.1145\/1321440.1321491"},{"key":"key2021010219524479000_b4","doi-asserted-by":"crossref","unstructured":"Church, K.W.\n and \n Hanks, P.\n (1989), \u201cWord association norms, mutual information and lexicography\u201d, Proceedings of the 27th Annual Meeting on Association for Computational Linguistics (ACL'89), Stroudsburg, PA, pp. 76-83.","DOI":"10.3115\/981623.981633"},{"key":"key2021010219524479000_b3","doi-asserted-by":"crossref","unstructured":"Cilibrasi, R.\n and \n Vitanyi, P.\n (2004), \u201cThe Google similarity distance\u201d, IEEE Transactions on Knowledge and Data Engineering, Vol. 19 No. 3, pp. 370-383.","DOI":"10.1109\/TKDE.2007.48"},{"key":"key2021010219524479000_b1","unstructured":"Etzioni, O.\n (1996), Moving Up the Information Food Chain: Deploying Softbots on the World Wide Web, AAAI, Mumbai."},{"key":"key2021010219524479000_b7","unstructured":"Franzoni, V.\n (2012), \u201cSemantic proxymity measures for the web\u201d, Laurea thesis, Department of Mathematics and Computer Science, Universit\u00e0 degli Studi di Perugia, Perugia."},{"key":"key2021010219524479000_b5","doi-asserted-by":"crossref","unstructured":"Franzoni, V.\n and \n Milani, A.\n (2012), \u201cPMING distance: a collaborative semantic proximity measure\u201d, 2012 IEEE\/WIC\/ACM International Conferences on Web Intelligence and Intelligent Agent Technology (WI-IAT), Vol. 2, pp. 442-449.","DOI":"10.1109\/WI-IAT.2012.226"},{"key":"key2021010219524479000_b28","doi-asserted-by":"crossref","unstructured":"Franzoni, V.\n and \n Milani, A.\n (2013), \u201cHeuristic semantic walk\u201d, Computational Science and Its Applications, Springer, Berlin, pp. 643-656.","DOI":"10.1007\/978-3-642-39649-6_46"},{"key":"key2021010219524479000_b25","unstructured":"Franzoni, V.\n , \n Leung, C.H.C.\n , \n Li, Y.X.\n and \n Milani, A.\n (2013), \u201cCollective evolutionary concept distance based query expansion for effective web document retrieval\u201d, Computational Science and Its Applications, Springer, Berlin, pp. 657-672."},{"key":"key2021010219524479000_b10","unstructured":"Gabrilovich, E.\n and \n Markovich, S.\n (2007), \u201cComputing semantic relatedness using Wikipedia-based explicit semantic analysis\u201d, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI'07), Morgan Kaufmann Publishers Inc., San Francisco, CA, pp. 1606-1611."},{"key":"key2021010219524479000_b27","doi-asserted-by":"crossref","unstructured":"Gori, M.\n , \n Maggini, M.O.\n and \n Sarti, L.\n (2005), \u201cExact and approximate graph matching using random walks\u201d, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27 No. 7, pp. 1100-1111.","DOI":"10.1109\/TPAMI.2005.138"},{"key":"key2021010219524479000_b6","unstructured":"Kurant, M.\n , \n Markopoulou, A.\n and \n Thiran, P.\n (2010), On the Bias of BSF, ITC, Kolkata."},{"key":"key2021010219524479000_b21","doi-asserted-by":"crossref","unstructured":"Leung, C.H.C.\n , \n Chan, W.S.\n , \n Milani, A.\n , \n Liu, J.\n and \n Li, Y.X.\n (2012), \u201cIntelligent social media indexing and sharing using an adaptive indexing search engine\u201d, ACM Transactions on Intelligent Systems and Technology, Vol. 3 No. 3, p. -.","DOI":"10.1145\/2168752.2168761"},{"key":"key2021010219524479000_b29","doi-asserted-by":"crossref","unstructured":"Lew, M.S.\n , \n Sebe, N.\n , \n Djeraba, C.\n and \n Jain, R.\n (2006), \u201cContent-based multimedia information retrieval: state of the art and challenges\u201d, ACM Trans. Multimedia Comput. Commun. Applicat., Vol. 2 No. 1, pp. 1-19.","DOI":"10.1145\/1126004.1126005"},{"key":"key2021010219524479000_b30","doi-asserted-by":"crossref","unstructured":"Li, B.\n and \n Chang, E.Y.\n (2003), \u201cDiscovery of a perceptual distance function for measuring image similarity\u201d, ACM Multimedia Journal Special Issue Content-Based Image Retrieval, Vol. 8 No. 6, pp. 512-522.","DOI":"10.1007\/s00530-002-0069-9"},{"key":"key2021010219524479000_b8","unstructured":"Manning, D.\n and \n Schutze, H.\n (2002), Foundations of Statistical Natural Language Processing, The MIT Press, London."},{"key":"key2021010219524479000_b17","doi-asserted-by":"crossref","unstructured":"Mayer, M.C.\n , \n Limongelli, C.\n , \n Orlandini, A.\n and \n Poggioni, V.\n (2007), \u201cLinear temporal logic as an executable semantics for planning languages\u201d, Journal of Logic, Language and Information, Vol. 16 No. 1, pp. 63-89.","DOI":"10.1007\/s10849-006-9022-1"},{"key":"key2021010219524479000_b22","unstructured":"Milani, A.\n , \n Baioletti, M.\n and \n Santucci, V.\n (2013), \u201cDiscrete differential evolution for learning Bayesian network structure\u201d, Proceedings of GECCO, Genetic and Evolutionary Computation Conference."},{"key":"key2021010219524479000_b24","doi-asserted-by":"crossref","unstructured":"Milani, A.\n , \n Santucci, V.\n and \n Leung, C.\n (2010), \u201cOptimal design of web information contents for E-commerce applications\u201d, Proceedings of the 25th International Symposium on Computer and Information Sciences, Lecture Notes in Electrical Engineering, Vol. 62, pp. 339-344, Part 8.","DOI":"10.1007\/978-90-481-9794-1_64"},{"key":"key2021010219524479000_b23","doi-asserted-by":"crossref","unstructured":"Milani, A.\n , \n Ukey, N.\n , \n Niyogi, R.\n and \n Singh, K.\n (2010), \u201cA bidirectional heuristic for web service composition with costs\u201d, International Journal of Web and Grid Services, Inderscience, Vol. 6, pp. 160-175.","DOI":"10.1504\/IJWGS.2010.033790"},{"key":"key2021010219524479000_b9","unstructured":"Milne, D.\n and \n Witten, I.H.\n (2008), \u201cAn effective, low-cost measure of semantic relatedness obtained from Wikipedia links\u201d, Proceedings of the First AAAI Workshop on Wikipedia and Artificial Intelligence (WIKIAI'08), Chicago, IL."},{"key":"key2021010219524479000_b12","unstructured":"Mukhopadhyay, D.\n , \n Banik, A.\n , \n Mukherjee, S.\n , \n Bhattacharya, J.\n and \n Kimin, Y.\n (2011), A Domain Specific Ontology Based Semantic Web Search Engine, ResearchGate, Cambridge, MA."},{"key":"key2021010219524479000_b14","unstructured":"Newman, M.E.J.\n (2003), Fast Algorithm for Detecting Community Structure in Networks, University of Michigan, Ann Arbor, MI."},{"key":"key2021010219524479000_b15","unstructured":"Richards, I.A.\n and \n Ogden, C.K.\n (1923), The Meaning of Meaning: A Study of the Influence of Language Upon Thought and of the Science of Symbolism, Harcourt, Brace & World, Inc., New York, NY."},{"key":"key2021010219524479000_b13","unstructured":"Smith, J.R.\n , \n Quirk, C.\n and \n Toutanova, K.\n (2010), \u201cExtracting parallel sentences from comparable corpora using document level alignment\u201d, paper presented at Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics."},{"key":"key2021010219524479000_b18","unstructured":"Turney, P.\n (2001), \u201cMining the web for synonyms: PMI versus LSA on TEOFL\u201d, Proceedings of the 12th European Conference on Machine Learning, Freiburg, Germany, pp. 491-502."},{"key":"key2021010219524479000_b20","doi-asserted-by":"crossref","unstructured":"Wu, L.\n , \n Hua, X.S.\n , \n Yu, N.\n , \n Ma, W.Y.\n and \n Li, S.\n (2008), Flickr Distance, Microsoft Research Asia, Beijing.","DOI":"10.1145\/1459359.1459364"},{"key":"key2021010219524479000_b19","doi-asserted-by":"crossref","unstructured":"Xu, Z.\n , \n Luo, X.\n , \n Yu, J.\n and \n Xu, W.\n (2011), \u201cMeasuring semantic similarity between words by removing noise and redundancy in web snippets\u201d, Concurrency and Computation: Practice and Experience, Vol. 23 No. 18, pp. 2496-2510.","DOI":"10.1002\/cpe.1816"},{"key":"key2021010219524479000_b11","doi-asserted-by":"crossref","unstructured":"Yeh, E.\n , \n Ramage, D.\n , \n Manning, C.D.\n , \n Agirre, E.\n and \n Soroa, A.\n (2009), \u201cWikiWalk: random walks on Wikipedia for semantic relatedness\u201d, Proceedings of the Graph-Based Methods for Natural Language Processing.","DOI":"10.3115\/1708124.1708133"},{"key":"key2021010219524479000_frd1","unstructured":"Franzoni, V.\n and \n Milani, A.\n (2014), \u201cPMING distance: a collaborative semantic proximity measure for web contexts\u201d, Web Intelligence and Agent Systems \u2013 An International Journal, Special Issue on Multi-Agent-Based Problem Solving Methods for Big Data Surge."},{"key":"key2021010219524479000_frd2","unstructured":"Gori, M.\n and \n Pucci, A.\n (2006), \u201cA random-walk based scoring algorithm with application to recommender systems for large-scale e-commerce\u201d, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA."}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/IJWIS-11-2013-0031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-11-2013-0031\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IJWIS-11-2013-0031\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:22Z","timestamp":1753395862000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/10\/1\/85-103\/375138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,14]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,4,14]]}},"alternative-id":["10.1108\/IJWIS-11-2013-0031"],"URL":"https:\/\/doi.org\/10.1108\/ijwis-11-2013-0031","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2014,4,14]]}}}