Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Who With Whom And How?: Extracting Large Social Networks Using Search Engines (1701.08285v1)

Published 28 Jan 2017 in cs.SI and cs.IR

Abstract: Social network analysis is leveraged in a variety of applications such as identifying influential entities, detecting communities with special interests, and determining the flow of information and innovations. However, existing approaches for extracting social networks from unstructured Web content do not scale well and are only feasible for small graphs. In this paper, we introduce novel methodologies for query-based search engine mining, enabling efficient extraction of social networks from large amounts of Web data. To this end, we use patterns in phrase queries for retrieving entity connections, and employ a bootstrapping approach for iteratively expanding the pattern set. Our experimental evaluation in different domains demonstrates that our algorithms provide high quality results and allow for scalable and efficient construction of social graphs.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Stefan Siersdorfer (2 papers)
  2. Philipp Kemkes (4 papers)
  3. Hanno Ackermann (18 papers)
  4. Sergej Zerr (3 papers)
Citations (10)

Summary

We haven't generated a summary for this paper yet.