{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:52Z","timestamp":1750308592775,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T00:00:00Z","timestamp":1454025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGIR Forum"],"published-print":{"date-parts":[[2016,1,29]]},"abstract":"<jats:p>Modern Web data is highly structured in terms of entities and relations from large knowledge resources, geo-temporal references and social network structure, resulting in a massivemultidimensional graph. This graph essentially unifies both the searcher and the information resources that played a fundamentally different role in traditional IR, and \"Graph Search\" offers major new ways to access relevant information. Graph search affects both query formulation (complex queries about entities and relations building on the searcher's context) as well as result exploration and discovery (slicing and dicing the information using the graph structure) in a completely personalized way. This new graph based approach introduces great opportunities, but also great challenges, in terms of data quality and data integration, user interface design, and privacy.<\/jats:p>\n          <jats:p>We view the notion of \"graph search\" as searching information from your personal point of view (you are the query) over a highly structured and curated information space. This goes beyond the traditional two-term queries and ten blue links results that users are familiar with, requiring a highly interactive session covering both query formulation and result exploration. The workshop brought together researchers from a range of areas in information access, who worked together on searching information from your personal point of view over a highly structured and curated information space.<\/jats:p>","DOI":"10.1145\/2888422.2888436","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T20:37:54Z","timestamp":1454359074000},"page":"89-97","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Report on the First SIGIR Workshop on Graph Search and Beyond (GSB'15)"],"prefix":"10.1145","volume":"49","author":[{"given":"Omar","family":"Alonso","sequence":"first","affiliation":[{"name":"Microsoft, Mountain View CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marti A.","family":"Hearst","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaap","family":"Kamps","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,1,29]]},"reference":[{"key":"e_1_2_1_1_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-19890-3_1","volume-title":"ICWE'15: Engineering the Web in the Big Data Era","author":"Alonso O.","year":"2015","unstructured":"O. Alonso and J. Kamps . Beyond graph search: Exploring and exploiting rich connected data sets . In ICWE'15: Engineering the Web in the Big Data Era , volume 9114 of LNCS , pages 3 -- 12 . Springer , 2015 . URL http:\/\/dx.doi.org\/10.1007\/978-3-319-19890-3_1. 10.1007\/978-3-319-19890-3_1 O. Alonso and J. Kamps. Beyond graph search: Exploring and exploiting rich connected data sets. In ICWE'15: Engineering the Web in the Big Data Era, volume 9114 of LNCS, pages 3--12. Springer, 2015. URL http:\/\/dx.doi.org\/10.1007\/978-3-319-19890-3_1."},{"key":"e_1_2_1_2_1","volume-title":"GSB'15: Proceedings of the SIGIR'15 Workshop on Graph Search and Beyond","author":"Alonso O.","year":"2015","unstructured":"O. Alonso , M. A. Hearst , and J. Kamps , editors . GSB'15: Proceedings of the SIGIR'15 Workshop on Graph Search and Beyond , 2015 . CEUR-WS. URL http:\/\/ceur-ws.org\/ Vol-1393\/. O. Alonso, M. A. Hearst, and J. Kamps, editors. GSB'15: Proceedings of the SIGIR'15 Workshop on Graph Search and Beyond, 2015. CEUR-WS. URL http:\/\/ceur-ws.org\/ Vol-1393\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00981759"},{"key":"e_1_2_1_4_1","first-page":"9","volume-title":"Alonso et al. {2}","author":"Jadeja M.","unstructured":"M. Jadeja and K. Shah . Tree-map: A visualization tool for large data . In Alonso et al. {2} , pages 9 -- 13 . URL http:\/\/ceur-ws.org\/Vol-1393\/. M. Jadeja and K. Shah. Tree-map: A visualization tool for large data. In Alonso et al. {2}, pages 9--13. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_5_1","unstructured":"S. Lim. Graph search at linkedin. In Alonso et al. {2} page 5. URL http:\/\/ceur-ws.org\/ Vol-1393\/.  S. Lim. Graph search at linkedin. In Alonso et al. {2} page 5. URL http:\/\/ceur-ws.org\/ Vol-1393\/."},{"key":"e_1_2_1_6_1","unstructured":"D. W. Oard. Good uses for crummy knowledge graphs. In Alonso et al. {2} page 6. URL http:\/\/ceur-ws.org\/Vol-1393\/.  D. W. Oard. Good uses for crummy knowledge graphs. In Alonso et al. {2} page 6. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_7_1","unstructured":"R. M. Philip. Personalized post search at facebook. In Alonso et al. {2} page 7. URL http:\/\/ceur-ws.org\/Vol-1393\/.  R. M. Philip. Personalized post search at facebook. In Alonso et al. {2} page 7. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_8_1","first-page":"14","volume-title":"Alonso et al. {2}","author":"Sabetghadam S.","unstructured":"S. Sabetghadam , M. Lupu , and A. Rauber . Leveraging metropolis-hastings algorithm on graph-based model for multimodal ir . In Alonso et al. {2} , pages 14 -- 18 . URL http:\/\/ ceur-ws.org\/Vol-1393\/. S. Sabetghadam, M. Lupu, and A. Rauber. Leveraging metropolis-hastings algorithm on graph-based model for multimodal ir. In Alonso et al. {2}, pages 14--18. URL http:\/\/ ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_9_1","first-page":"19","volume-title":"Alonso et al. {2}","author":"Sakamoto K.","unstructured":"K. Sakamoto , H. Shibuki , T. Mori , and N. Kando . Fusion of heterogeneous information in graph-based ranking for query-biased summarization . In Alonso et al. {2} , pages 19 -- 22 . URL http:\/\/ceur-ws.org\/Vol-1393\/. K. Sakamoto, H. Shibuki, T. Mori, and N. Kando. Fusion of heterogeneous information in graph-based ranking for query-biased summarization. In Alonso et al. {2}, pages 19--22. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_10_1","first-page":"23","volume-title":"Alonso et al. {2}","author":"Santisteban J.","unstructured":"J. Santisteban and J. T. C\u00e1rcamo . Unilateral jaccard similarity coefficient . In Alonso et al. {2} , pages 23 -- 27 . URL http:\/\/ceur-ws.org\/Vol-1393\/. J. Santisteban and J. T. C\u00e1rcamo. Unilateral jaccard similarity coefficient. In Alonso et al. {2}, pages 23--27. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661967"},{"key":"e_1_2_1_12_1","first-page":"28","volume-title":"Alonso et al. {2}","author":"Tong B.","unstructured":"B. Tong , T. Yanase , H. Ozaki , and M. Iwayama . Information retrieval boosted by category for troubleshooting search system . In Alonso et al. {2} , pages 28 -- 32 . URL http:\/\/ceur-ws.org\/Vol-1393\/. B. Tong, T. Yanase, H. Ozaki, and M. Iwayama. Information retrieval boosted by category for troubleshooting search system. In Alonso et al. {2}, pages 28--32. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_13_1","unstructured":"A. D. Wade. Overview of microsoft academic graph. In Alonso et al. {2} page 8. URL http:\/\/ceur-ws.org\/Vol-1393\/.  A. D. Wade. Overview of microsoft academic graph. In Alonso et al. {2} page 8. URL http:\/\/ceur-ws.org\/Vol-1393\/."},{"key":"e_1_2_1_14_1","first-page":"33","volume-title":"Alonso et al. {2}","author":"Yu Y.","unstructured":"Y. Yu , Z. Jiang , and X. Liu . Random walk and feedback on scholarly network . In Alonso et al. {2} , pages 33 -- 37 . URL http:\/\/ceur-ws.org\/Vol-1393\/. Y. Yu, Z. Jiang, and X. Liu. Random walk and feedback on scholarly network. In Alonso et al. {2}, pages 33--37. URL http:\/\/ceur-ws.org\/Vol-1393\/."}],"container-title":["ACM SIGIR Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2888422.2888436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2888422.2888436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:25Z","timestamp":1750273525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2888422.2888436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,29]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,1,29]]}},"alternative-id":["10.1145\/2888422.2888436"],"URL":"https:\/\/doi.org\/10.1145\/2888422.2888436","relation":{},"ISSN":["0163-5840"],"issn-type":[{"type":"print","value":"0163-5840"}],"subject":[],"published":{"date-parts":[[2016,1,29]]},"assertion":[{"value":"2016-01-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}