• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
3
0
0

Texte intégral

(1)

Preface

These proceedings contain the contributed papers of the First International Workshop on Graph Search and Beyond (GSB 2015), held at SIGIR 2015 in Santiago de Chile, on August 13, 2015.

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 massive multidimensional 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 (com- plex 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. 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 re- sults that users are familiar with, requiring a highly interactive session covering both query formulation and result exploration. The workshop attracted a range of researchers working on this and related topics, and made concrete progress working together on one of the greatest challenges in the years to come.

The workshop consisted of three main parts. First, four keynotes to help us frame the problem, and create a common understanding of the challenges: Rose Marie Philip (Facebook), Swee Lim (Linkedin), Doug Oard (Maryland), and Alex Wade (Microsoft Research). Second, a boaster and poster session with 6 papers selected by the program committee from 8 submissions (a 75% acceptance rate).

Each paper was reviewed by at least two members of the program committee.

Third, breakout groups on different aspects of exploiting graph search, with reports being discussed in the final session. The papers represent the ideas and opinions of the authors who are trying to stimulate debate. It is the combination of these papers and the debate that will make the workshop a success! We thank the ACM and SIGIR for hosting this workshop, and Diane Kelly, Fernando Diaz and Diego Arroyuelo for their outstanding support in the organization. Thanks also go to the program committee, the authors of the papers, and all participants without whom there would be no workshop.

July, 2015 Omar Alonso

Marti A. Hearst Jaap Kamps

(2)
(3)

Table of Contents

Overview Paper

Overview of Graph Search and Beyond . . . 1 Omar Alonso, Marti Hearst and Jaap Kamps

Invited Papers

Graph Search at LinkedIn. . . 5 Swee Lim

Good Uses for Crummy Knowledge Graphs . . . 6 Douglas Oard

Personalized Post Search at Facebook . . . 7 Rose Marie Philip

Overview of Microsoft Academic Graph. . . 8 Alex Wade

Contributed Papers

Tree-Map: A Visualization Tool for Large Data . . . 9 Mahipal Jadeja and Kesha Shah

Leveraging Metropolis-Hastings Algorithm on Graph-based Model for

Multimodal IR . . . 14 Serwah Sabetghadam, Mihai Lupu and Andreas Rauber

Fusion of Heterogeneous Information in Graph-Based Ranking for

Query-Biased Summarization. . . 19 Kotaro Sakamoto, Hideyuki Shibuki, Tatsunori Mori and Noriko Kando

Unilateral Jaccard Similarity Coefficient . . . 23 Julio Santisteban and Javier Tejada C´arcamo

Information Retrieval Boosted by Category for Troubleshooting Search

System . . . 28 Bin Tong, Toshihiko Yanase, Hiroaki Ozaki and Makoto Iwayama

Random Walk and Feedback on Scholarly Network. . . 33 Yingying Yu, Zhuoren Jiang and Xiaozhong Liu

Références

Documents relatifs

We describe the architecture of the system, the graph and data models, and index structures used to support the multiplicity and provenance of attribute and relation values,

We implement a prototype of this framework using (a) a repository of feature vector rep- resentations associated with entities in a knowledge graph, (b) a mapping between the

To build our knowledge graph, we have adapted OntoADR [3], extending it with SMQs (Standardised MedDRA Queries) [5] and anonymized patient data from FAERS dataset [1] to show how

After defining the “value suggestion problem”, we introduced three suggestion functions: an optimal one that is slow for large data sets and complex queries; a range based one that

Precisely, we focused on schema-driven generation of complex and broad graph queries with user-defined features, on the complexity of the evaluation of regular simple path queries

In our work we propose an elementary concept to support temporal analysis with property graph databases, using a single-graph model limited to structural changes.. We manage

We compared the clustering performance of the proposed topic detection framework, in which the DBSCAN-Martingale algorithm (for estimating the number of topics) and LDA (for

FedViz facilitates both federated and non-federated SPARQL queries formulation through a visual interface and uses FedX for query execution and the results retrieval.. We evaluate