The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Community Mining from Signed Social Networks
Abstract
Many complex systems in the real world can be modeled as signed social networks that contain both positive and negative relations. Algorithms for mining social networks have been developed in the past, however most of them were designed primarily for networks containing only positive relations and thus not suitable for signed networks. In this work, we propose a new algorithm, called FEC, to mine signed social networks so that both positive within-group relations and negative between-group relations are dense. FEC considers both the sign and the density of relations as the clustering attributes, making itself effective for not only signed networks but also conventional social networks including only positive relations. Also, FEC adopts an agent-based heuristic that makes the algorithm efficient (in linear time with respect to the size of a network) and capable of giving nearly optimal solutions. FEC depends on only one parameter whose value can easily be set, and requires no prior knowledge on hidden community structures. The effectiveness and efficacy of FEC have been demonstrated through a set of rigorous experiments involving both benchmark and randomly-generated signed networks.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Social Network Analysis: A Handbook.
Pappi, F. U., & Scott, J. (1993) · Contemporary Sociology · doi:10.2307/2075047 · Cited by 5,969
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450
Computing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11569596_31 · Cited by 2,048
Partitioning Sparse Matrices with Eigenvectors of Graphs
Pothen, A., Simon, H. D., & Liou, K.-P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611030 · Cited by 1,684
Computing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2006) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00124 · Cited by 1,501
Focused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,486
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
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
Bansal, N., Blum, A., & Chawla, S. (2004) · Machine Learning · doi:10.1023/b:mach.0000033116.57574.95 · Cited by 1,075
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
Self-organization and identification of Web communities
Flake, G. W., Lawrence, S., Giles, C. L., & Coetzee, F. M. (2002) · Computer · doi:10.1109/2.989932 · Cited by 1,018
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
Burt, R. S. (1976) · Social Forces · doi:10.1093/sf/55.1.93 · Cited by 607
Email as Spectroscopy: Automated Discovery of Community Structure within Organizations
Tyler, J. R., Wilkinson, D. M., & Huberman, B. A. (2003) · Communities and Technologies · doi:10.1007/978-94-017-0115-0_5 · Cited by 425
Silk from a sow's ear: extracting usable structures from the Web
Pirolli, P., Pitkow, J., & Rao, R. (1996) · Proceedings of the SIGCHI conference on Human factors in computing systems common ground - CHI '96 · doi:10.1145/238386.238450 · Cited by 378
E-Mail as Spectroscopy: Automated Discovery of Community Structure within Organizations
Tyler, J. R., Wilkinson, D. M., & Huberman, B. A. (2005) · The Information Society · doi:10.1080/01972240590925348 · Cited by 327
A partitioning approach to structural balance
Doreian, P., & Mrvar, A. (1996) · Social Networks · doi:10.1016/0378-8733(95)00259-6 · Cited by 297
(2009) · Encyclopedia of Database Systems · doi:10.1007/978-0-387-39940-9_2309 · Cited by 262
Cultures of the Central Highlands, New Guinea
Read, K. E. (1954) · Southwestern Journal of Anthropology · doi:10.1086/soutjanth.10.1.3629074 · Cited by 236
Bansal, N., Blum, A., & Chawla, S. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181947 · Cited by 178
ASONAM 2010 and OSINT-WM 2010 Invited Keynotes
Wasserman, S. S. (2010) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2010.89 · Cited by 46
Cited by
Gong, M., Cai, Q., Chen, X., & Ma, L. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2260862 · Cited by 394
The Slashdot Zoo: Mining a Social Network with Negative Edges
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2017) · arXiv (Cornell University) · doi:10.24406/publica-r-363202 · Cited by 384
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
The slashdot zoo: mining a social network with negative edges
Kunegis, J., Lommatzsch, A., & Bauckhage, C. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526809 · Cited by 342
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Metadata
- Authors
- Yang, B., Cheung, W., & Liu, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-10
- Volume
- 19
- Issue
- 10
- Pages
- 1333-1348
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2097216034
- Cited by
- 383
- References
- 37
- FWCI
- 8.40
- Type
- journal article
- 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.