The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Discovering important nodes through graph entropy the case of Enron email database
Abstract
A major problem in social network analysis and link discovery is the discovery of hidden organizational structure and selection of interesting influential members based on low-level, incomplete and noisy evidence data. To address such a challenge, we exploit an information theoretic model that combines information theory with statistical techniques from area of text mining and natural language processing. The Entropy model identifies the most interesting and important nodes in a graph. We show how entropy models on graphs are relevant to study of information flow in an organization. We review the results of two different experiments which are based on entropy models. The first version of this model has been successfully tested and evaluated on the Enron email dataset.
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Identifying sets of key players in a social network
Borgatti, S. P. (2006) · Computational and Mathematical Organization Theory · doi:10.1007/s10588-006-7084-x · Cited by 1,174
Noble, C. C., & Cook, D. J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956831 · Cited by 454
Algorithms for estimating relative importance in networks
White, S., & Smyth, P. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956782 · Cited by 408
Who Is the Best Connected Scientist?A Study of Scientific Coauthorship Networks
Newman, M. E. J. (2004) · Lecture Notes in Physics · doi:10.1007/978-3-540-44485-5_16 · Cited by 379
Fast discovery of connection subgraphs
Faloutsos, C., McCurley, K. S., & Tomkins, A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014068 · Cited by 355
Cited by
Phrases that signal workplace hierarchy
Gilbert, E. (2012) · Proceedings of the ACM 2012 conference on Computer Supported Cooperative Work · doi:10.1145/2145204.2145359 · Cited by 98
Metadata
- Authors
- Shetty, J., & Adibi, J.
- Venue
- Proceedings of the 3rd international workshop on Link discovery
- Publisher
- ACM
- Published
- 2005-08-21
- Pages
- 74-81
- OpenAlex
- W2012557827
- Cited by
- 254
- References
- 15
- FWCI
- 12.68
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Discovering important nodes through graph entropy the case of Enron email database. https://app.cochat.ai/papers/10.1145/1134271.1134282
- The paper
- Shetty, J., & Adibi, J. (2005). Discovering important nodes through graph entropy the case of Enron email database. Proceedings of the 3rd international workshop on Link discovery. https://doi.org/10.1145/1134271.1134282
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.