The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Expertise networks in online communities: structure and algorithms
Abstract
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other online networks such as the World Wide Web. Systems targeted to augment web-based communities by automatically identifying users with expertise, for example, need to adapt to the underlying interaction dynamics. In this study, we analyze the Java Forum, a large online help-seeking community, using social network analysis methods. We test a set of network-based ranking algorithms, including PageRank and HITS, on this large size social network in order to identify users with high expertise. We then use simulations to identify a small number of simple simulation rules governing the question-answer dynamic in the network. These simple rules not only replicate the structural characteristics and algorithm performance on the empirically observed Java Forum, but also allow us to evaluate how other algorithms may perform in communities with different characteristics. We believe this approach will be fruitful for practical algorithm design and implementation for online expertise-sharing communities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,993
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
(1999) · Cited by 12,854
Evaluating collaborative filtering recommender systems
Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963772 · Cited by 5,798 · cited 1×
“Two of the most frequently used correlation measures between two ranks are Spearman’s rho and Kendall’s Tau [10, 13 ].”
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 2×
“Figure 2, 3 and Table 1 compare the bow tie structure of the Java Forum network with that of the Web (as reported in [ 7 ]).”
How open source software works: “free” user-to-user assistance
Lakhani, K. R., & von Hippel, E. (2003) · Research Policy · doi:10.1016/s0048-7333(02)00095-1 · Cited by 1,596
Adams, R. G., Smith, M. A., & Kollock, P. (1999) · Contemporary Sociology · doi:10.2307/2655574 · Cited by 1,380
Referral Web: combining social networks and collaborative filtering
Kautz, H., Selman, B., & Shah, M. (1997) · Communications of the ACM · doi:10.1145/245108.245123 · Cited by 847
Co-authorship networks in the digital library research community
Liu, X., Bollen, J., Nelson, M. L., & Van de Sompel, H. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2005.03.012 · Cited by 823
(2003) · doi:10.5555/644108.644113 · Cited by 762
Hubs, authorities, and communities
Kleinberg, J. M. (1999) · ACM Computing Surveys · doi:10.1145/345966.345982 · Cited by 506
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Expertise identification using email communications
Campbell, C. S., Maglio, P. P., Cozzi, A., & Dom, B. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956965 · Cited by 324
Link analysis ranking: algorithms, theory, and experiments
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052942 · Cited by 308
Sharing Expertise: Beyond Knowledge Management
Ackerman, M. S., Wulf, V., & Pipek, V. (2002) · MIT Press Books · Cited by 297
Self-citationAnswer Garden 2: merging organizational memory with collaborative help
Ackerman, M. S., & McDonald, D. W. (1996) · Proceedings of the 1996 ACM conference on Computer supported cooperative work · doi:10.1145/240080.240203 · Cited by 294
Self-citationYou Are Who You Talk To: Detecting Roles in Usenet Newsgroups
Fisher, D., Smith, M., & Welser, H. T. (2006) · Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06) · doi:10.1109/hicss.2006.536 · Cited by 260
Toward alternative metrics of journal impact: A comparison of download and citation data
Bollen, J., Van de Sompel, H., Smith, J. A., & Luce, R. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2005.03.024 · Cited by 210
Littlepage, G. E., & Mueller, A. L. (1997) · Group Dynamics Theory Research and Practice · doi:10.1037//1089-2699.1.4.324 · Cited by 85
Who Knows: A System Based on Automatic Representation of Semantic Structure.
Streeter, L. A., & Lochbaum, K. E. (1988) · RIAO · Cited by 54
Cited by
Finding high-quality content in social media
Agichtein, E., Castillo, C., Donato, D., Gionis, A., & Mishne, G. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341557 · Cited by 1,230
Leonardi, P. M., Huysman, M., & Steinfield, C. (2013) · Journal of Computer-Mediated Communication · doi:10.1111/jcc4.12029 · Cited by 1,173
Knowledge sharing and yahoo answers: everyone knows something
Adamic, L. A., Zhang, J., Bakshy, E., & Ackerman, M. S. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367587 · Cited by 732
Self-citationHarvesting ambient geospatial information from social media feeds
Stefanidis, A., Crooks, A., & Radzikowski, J. (2013) · GeoJournal · doi:10.1007/s10708-011-9438-2 · Cited by 565
Design lessons from the fastest q&a site in the west
Mamykina, L., Manoim, B., Mittal, M., Hripcsak, G., & Hartmann, B. (2011) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1978942.1979366 · Cited by 553
Metadata
- Authors
- Zhang, J., Ackerman, M. S., & Adamic, L.
- Venue
- Proceedings of the 16th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2007-05-08
- Pages
- 221-230
- OpenAlex
- W2132613313
- Cited by
- 789
- References
- 22
- FWCI
- 35.62
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.