Liang Ma
ABSTRACT
Expert networks are formed by a group of expert-profes\-sionals with different specialties to collaboratively resolve specific queries. In such networks, when a query reaches an expert who does not have sufficient expertise, this query needs to be routed to other experts for further processing until it is completely solved; therefore, query answering efficiency is sensitive to the underlying query routing mechanism being used. Among all possible query routing mechanisms, decentralized search, operating purely on each expert's local information without any knowledge of network global structure, represents the most basic and scalable routing mechanism. However, there is still a lack of fundamental understanding of the efficiency of decentralized search in expert networks. In this regard, we investigate decentralized search by quantifying its performance under a variety of network settings. Our key findings reveal the existence of network conditions, under which decentralized search can achieve significantly short query routing paths (i.e., between O(log n) and O(log2 n) hops, n: total number of experts in the network). Based on such theoretical foundation, we then study how the unique properties of decentralized search in expert networks is related to the anecdotal small-world phenomenon. To the best of our knowledge, this is the first work studying fundamental behaviors of decentralized search in expert networks. The developed performance bounds, confirmed by real datasets, can assist in predicting network performance and designing complex expert networks.
- K. Balog, L. Azzopardi, and M. De Rijke, "Formal models for expert finding in enterprise corpora," in ACM SIGIR, 2006. Google Scholar
Digital Library
- P. Serdyukov, H. Rode, and D. Hiemstra, "Modeling multi-step relevance propagation for expert finding," in ACM CIKM, 2008. Google ScholarDigital Library
- Q. Shao, Y. Chen, S. Tao, X. Yan, and N. Anerousis, "Efficient ticket routing by resolution sequence mining," in ACM SIGKDD, 2008. Google ScholarDigital Library
- H. Zhang, E. Horvitz, Y. Chen, and D. C. Parkes, "Task routing for prediction tasks," in AAMAS, 2012. Google ScholarDigital Library
- G. Miao, L. E. Moser, X. Yan, S. Tao, Y. Chen, and N. Anerousis, "Generative models for ticket resolution in expert networks," in ACM SIGKDD, 2010. Google ScholarDigital Library
- A. Banerjee and S. Basu, "A social query model for decentralized search," in ACM SNAKDD, 2008.Google Scholar
- J. Kleinberg and P. Raghavan, "Query incentive networks," in IEEE FOCS, 2005. Google ScholarDigital Library
- J. Zeng and W. Hsu, "Optimal routing in a small-world network," Journal of Computer Science & Technology, vol. 21, pp. 476--481, 2006.Google ScholarCross Ref
- H. Sun, M. Srivatsa, S. Tan, Y. Li, L. M. Kaplan, S. Tao, and X. Yan, "Analyzing expert behaviors in collaborative networks," in ACM SIGKDD, 2014. Google ScholarDigital Library
- B. Bollobás and F. D. L. Vega, "The diameter of random regular graphs," Combinatorica, vol. 2, pp. 125--134, 1982.Google ScholarCross Ref
- D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, pp. 440--442, 1998.Google ScholarCross Ref
- M. Draief and A. Ganesh, "Efficient routeing in poisson small-world networks," Journal of Applied Probability, pp. 678--686, 2006.Google ScholarCross Ref
- L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, "Search in power-law networks," Phys. Rev. E, vol. 64, p. 046135, 2001.Google ScholarCross Ref
- S. Milgram, "The small world problem," Psychology Today, vol. 67, pp. 61--67, 1967.Google Scholar
- J. Travers and S. Milgram, "An experimental study of the small world problem," Sociometry, vol. 32, pp. 425--443, 1969.Google ScholarCross Ref
- C. Korte and S. Milgram, "Acquaintance networks between racial groups: Application of the small world method," Journal of Personality and Social Psychology, vol. 15, pp. 101--108, 1970.Google ScholarCross Ref
- J. Guare, Six Degrees of Separation: A Play. Vintage Books, 1990.Google Scholar
- J. Kleinberg, "The small-world phenomenon: An algorithmic perspective," in ACM STOC, 2000. Google ScholarDigital Library
- L. Ma, "Query answering via decentralized search," Technical Report, IBM T. J. Watson Research Center, Yorktown, NY, USA, Jul 2016. {Online}. Available: http://researcher.ibm.com/researcher/files/us-maliang/QueryRoutingTR.pdfGoogle Scholar
- J. Kleinberg, "Complex networks and decentralized search algorithms," in International Congress of Mathematicians, 2006.Google Scholar
Index Terms
- Query Answering Efficiency in Expert Networks Under Decentralized Search
Recommendations
Performance Bounds of Decentralized Search in Expert Networks for Query Answering
Expert networks are formed by a group of expert-professionals with different specialties to collaboratively resolve specific queries posted to the network. In such networks, when a query reaches an expert who does not have sufficient expertise, this ...
Weight-based consistent query answering over inconsistent $${\mathcal {SHIQ}}$$ knowledge bases
Non-standard query mechanisms that work under inconsistency are required in some important description logic (DL)-based applications, including those involving an inconsistent DL knowledge base ( KB) whose intensional knowledge is consistent but is ...
Comments