The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Edge Weight Prediction in Weighted Signed Networks
Abstract
Weighted signed networks (WSNs) are networks in which edges are labeled with positive and negative weights. WSNs can capture like/dislike, trust/distrust, and other social relationships between people. In this paper, we consider the problem of predicting the weights of edges in such networks. We propose two novel measures of node behavior: the goodness of a node intuitively captures how much this node is liked/trusted by other nodes, while the fairness of a node captures how fair the node is in rating other nodes' likeability or trust level. We provide axioms that these two notions need to satisfy and show that past work does not meet these requirements for WSNs. We provide a mutually recursive definition of these two concepts and prove that they converge to a unique solution in linear time. We use the two measures to predict the edge weight in WSNs. Furthermore, we show that when compared against several individual algorithms from both the signed and unsigned social network literature, our fairness and goodness metrics almost always have the best predictive power. We then use these as features in different multiple regression models and show that we can predict edge weights on 2 Bitcoin WSNs, an Epinions WSN, 2 WSNs derived from Wikipedia, and a WSN derived from Twitter with more accurate results than past work. Moreover, fairness and goodness metrics form the most significant feature for prediction in most (but not all) cases.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
VADER: a parsimonious rule-based model for sentiment analysis of social media text
Hutto, C., & Gilbert, E. (2014) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v8i1.14550 · Cited by 6,087
The EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
Structural balance: a generalization of Heider's theory.
Cartwright, D., & Harary, F. (1956) · Psychological Review · doi:10.1037/h0046049 · Cited by 2,525
Predicting positive and negative links in online social networks
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772756 · Cited by 1,470
Propagation of trust and distrust
Guha, R., Kumar, R., Raghavan, P., & Tomkins, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988727 · Cited by 1,464
Predicting tie strength with social media
Gilbert, E., & Karahalios, K. (2009) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1518701.1518736 · Cited by 1,382
The Eigentrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775240.775242 · Cited by 1,365
Signed networks in social media
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753532 · Cited by 1,306
SNAP: A General-Purpose Network Analysis and Graph-Mining Library
Leskovec, J., & Sosič, R. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2898361 · Cited by 870
Modeling relationship strength in online social networks
Xiang, R., Neville, J., & Rogati, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772790 · Cited by 660
Community detection in networks with positive and negative links
Traag, V. A., & Bruggeman, J. (2009) · Physical Review E · doi:10.1103/physreve.80.036115 · Cited by 434
A Survey of Signed Network Mining in Social Media
Tang, J., Chang, Y., Aggarwal, C., & Liu, H. (2017) · ACM Computing Surveys · doi:10.1145/2956185 · Cited by 342
Beware the Middleman: Empirical Analysis of Bitcoin-Exchange Risk
Moore, T., & Christin, N. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_3 · Cited by 336
Using Transactional Information to Predict Link Strength in Online Social Networks
Kahanda, I., & Neville, J. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13957 · Cited by 205
Exploiting Social Network Structure for Person-to-Person Sentiment Analysis
West, R., Paskov, H. S., Leskovec, J., & Potts, C. (2014) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00184 · Cited by 198
Using sentiment to detect bots on Twitter: Are humans more opinionated than bots?
Dickerson, J. P., Kagan, V., & Subrahmanian, V. S. (2014) · 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014) · doi:10.1109/asonam.2014.6921650 · Cited by 185
Self-citationPredicting Trust and Distrust in Social Networks
DuBois, T., Golbeck, J., & Srinivasan, A. (2011) · doi:10.1109/passat/socialcom.2011.56 · Cited by 155
Predicting tie strength in a new medium
Gilbert, É. (2012) · ACM Conference on Computer Supported Cooperative Work (CSCW) · doi:10.1145/2145204.2145360 · Cited by 138
Calculating status with negative relations
Bonacich, P., & Lloyd, P. (2004) · Social Networks · doi:10.1016/j.socnet.2004.08.007 · Cited by 123
Friend or frenemy? predicting signed ties in social networks
Yang, S.-H., Smola, A. J., Long, B., Hongyuan Zha, B., & Chang, Y. (2012) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2348283.2348359 · Cited by 117
Finding the bias and prestige of nodes in networks based on trust scores
Mishra, A. P., & Bhattacharya, A. (2011) · International World Wide Web Conference (WWW) · doi:10.1145/1963405.1963485 · Cited by 102
Ranking Nodes in Signed Social Networks
Shahriari, M., & Jalili, M. (2014) · Social Network Analysis and Mining · doi:10.1007/s13278-014-0172-x · Cited by 87
Using Twitter Sentiment to Forecast the 2013 Pakistani Election and the 2014 Indian Election
Kagan, V., Stevens, A., & Subrahmanian, V. S. (2015) · IEEE Intelligent Systems · doi:10.1109/mis.2015.16 · Cited by 80
Self-citationUsing strong triadic closure to characterize ties in social networks
Sintos, S., & Tsaparas, P. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623664 · Cited by 80
Social network-based trust in prioritized default logic
Yarden Katz, A., & Golbeck, J. (2006) · Cited by 65
Building a signed network from interactions in Wikipedia
Maniu, S., Cautis, B., & Abdessalem, T. (2011) · Databases and Social Networks · doi:10.1145/1996413.1996417 · Cited by 59
Accurately detecting trolls in Slashdot Zoo via decluttering
Kumar, S., Spezzano, F., & Subrahmanian, V. S. (2014) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2014.6921581 · Cited by 39
Self-citationStructure and Dynamics of Signed Citation Networks
Kumar, S. (2016) · doi:10.1145/2872518.2889391 · Cited by 21
Self-citationFoundations of Trust and Distrust in Networks: Extended Structural Balance Theory
Qian, Y., & Adalı, S. (2014) · ACM Transactions on the Web · doi:10.1145/2628438 · Cited by 20
Community Structure and Information Cascade in Signed Networks
Shafaei, M., & Jalili, M. (2014) · New Generation Computing · doi:10.1007/s00354-014-0404-7 · Cited by 17
Trustingness & trustworthiness: a pair of complementary trust measures in a social network
Roy, A. S., Sarkar, C., Srivastava, J., & Huh, J. (2016) · doi:10.5555/3192424.3192527 · Cited by 17
Trustingness & trustworthiness: A pair of complementary trust measures in a social network
Roy, A., Sarkar, C., Srivastava, J., & Huh, J. (2016) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2016.7752289 · Cited by 17
Cited by
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
REV2: Fraudulent User Prediction in Rating Platforms
Kumar, S., Hooi, B., Makhija, D., Kumar, M., Faloutsos, C., & Subrahmanian, V. S. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159729 · Cited by 372
Self-citationeFraudCom: An E-commerce Fraud Detection System via Competitive Graph Neural Networks
Zhang, G., Li, Z., Huang, J., Wu, J., Zhou, C., Yang, J., & Gao, J. (2022) · ACM Transactions on Information Systems · doi:10.1145/3474379 · Cited by 177
Anomaly Detection in Dynamic Graphs via Transformer
Liu, Y., Pan, S., Wang, Y. G., Xiong, F., Wang, L., Chen, Q., & Lee, V. C. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124061 · Cited by 169
Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs
Cai, L., Chen, Z., Luo, C., Gui, J., Ni, J., Li, D., & Chen, H. (2021) · Proceedings of the 30th ACM International Conference on Information & Knowledge Management · doi:10.1145/3459637.3481955 · Cited by 146
Metadata
- Authors
- Kumar, S., Spezzano, F., Subrahmanian, V. S., & Faloutsos, C.
- Venue
- 2016 IEEE 16th International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2016-12
- Pages
- 221-230
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2585835859
- Cited by
- 498
- References
- 34
- FWCI
- 36.75
- 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.