EOS: Bridging Knowledge Silos via Social Network Search
EOS: Expertise Oriented Search Using Social Networks
The paper introduces EOS (Expertise Oriented Search), a pioneer researcher social network system that integrates data from distributed web sources like DBLP and CiteSeer. It employs a relevancy propagation-based algorithm to rank experts and a two-stage approach to efficiently discover associations between nearly half a million computer science researchers.
TL;DR
EOS (Expertise Oriented Search) is a landmark system designed to transform the way we find academic experts and their connections. By crawling the web and DBLP, it builds a massive social graph and uses a novel relevancy propagation algorithm to rank researchers not just by what they write, but by who they collaborate with.
Contextual Positioning
Published in WWW'07, this work serves as the structural precursor to ArnetMiner, one of the most significant academic search engines globally. It marks a transition from simple Keyword-in-Document retrieval to Relational Expertise Mining.
Problem & Motivation: The Silo Effect
Before EOS, finding an expert was a manual, disjointed process. You either searched for "Papers" (IR approach) or looked at "People Profiles" (Database approach). The authors noticed a massive untapped signal: The Social Network.
The challenges were two-fold:
- Data Messiness: Disparate web pages and DBLP records needed cleaning and "de-duplication."
- Graph Complexity: Mining associations in a graph with millions of paths is computationally expensive for real-time web use.
Methodology: The Core Engine
The EOS system relies on a two-phased approach for both its primary services.
1. Expert Search via Relevancy Propagation
Instead of just looking for keywords in a researcher's bio, the system calculates a base relevancy score () and then "spreads" that relevancy through the co-authorship network.

The intuition is simple but powerful: If you collaborate with experts in AI, you are likely an expert in AI yourself, even if your profile doesn't explicitly list every keyword.
2. Association Search: The Shortest Path Problem
How do you find how Professor A is connected to Researcher B? In a graph of ~500k nodes, a brute-force search is impossible. EOS uses:
- Stage 1 (Heap-Dijkstra): To find the skeletal distances.
- Stage 2 (Bounded DFS): To enumerate specific paths within a "Small World" constraint (max length of 7).
Experiments & Results
The system was evaluated against expert lists from top conference committees.
- Efficiency: Association searches were optimized to take less than 3 seconds, whereas naive methods took over 20 minutes (400x speedup).
- Accuracy: By incorporating co-authorship weights, the ranking precision significantly surpassed traditional Information Retrieval (IR) baselines.
Figure 1: The conceptual framework of the EOS system integration.
Critical Analysis & Conclusion
The Takeaway: EOS proved that academic expertise is a "social property." By mapping the hidden web of collaborations, it created the blueprint for how we navigate the scientific landscape today.
Limitations:
- The name disambiguation (handling two "John Smiths") was primarily heuristic-based in this version.
- The network only considered co-authorship, ignoring citation networks or shared affiliations which could offer deeper semantic layers.
Future Outlook: This work paved the way for modern "Knowledge Graphs." Today, the descendants of EOS utilize Large Language Models (LLMs) and Graph Neural Networks to provide even more nuanced researcher insights, but the core principle—relevancy through connection—remains the gold standard.
