The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
MatrixExplorer: a Dual-Representation System to Explore Social Networks
Abstract
MatrixExplorer is a network visualization system that uses two representations: node-link diagrams and matrices. Its design comes from a list of requirements formalized after several interviews and a participatory design session conducted with social science researchers. Although matrices are commonly used in social networks analysis, very few systems support the matrix-based representations to visualize and analyze networks. MatrixExplorer provides several novel features to support the exploration of social networks with a matrix-based representation, in addition to the standard interactive filtering and clustering functions. It provides tools to reorder (layout) matrices, to annotate and compare findings across different layouts and find consensus among several clusterings. MatrixExplorer also supports Node-link diagram views which are familiar to most users and remain a convenient way to publish or communicate exploration results. Matrix and node-link representations are kept synchronized at all stages of the exploration process.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Cluster analysis and display of genome-wide expression patterns
Eisen, M. B., Spellman, P. T., Brown, P. O., & Botstein, D. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.25.14863 · Cited by 16,184
R: A Language for Data Analysis and Graphics
Ihaka, R., & Gentleman, R. (1996) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1996.10474713 · Cited by 11,220
Exploratory Social Network Analysis with Pajek: Revised and Expanded Edition for Updated Software
De Nooy, W., Mrvar, A., & Batagelj, V. (2018) · Cambridge University Press eBooks · doi:10.1017/9781108565691 · Cited by 2,052
Graph Drawing: Algorithms for the Visualization of Graphs
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1998) · Iris (Roma Tre University) · Cited by 1,977
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Helsgaun, K. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00284-2 · Cited by 1,630
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
An open graph visualization system and its applications to software engineering
Gansner, E. R., & North, S. C. (2000) · Software: Practice and Experience · doi:10.1002/1097-024x(200009)30:11<1203::aid-spe338>3.0.co;2-n · Cited by 1,273
Exploratory Social Network Analysis with Pajek
de Nooy, W., Mrvar, A., & Batagelj, V. (2005) · doi:10.1017/cbo9780511806452 · Cited by 1,244
Direct Clustering of a Data Matrix
Hartigan, J. A. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481214 · Cited by 1,165
Rao, R., & Card, S. K. (1994) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/191666.191776 · Cited by 669
A survey of graph layout problems
Díaz, J., Petit, J., & Serna, M. (2002) · ACM Computing Surveys · doi:10.1145/568522.568523 · Cited by 599
Vizster: Visualizing Online Social Networks
Heer, J., & Boyd, D. (2006) · Proceedings of the 2005 IEEE Symposium on Information Visualization (INFOVIS'05) · doi:10.1109/infovis.2005.39 · Cited by 542
Doreian, P., Batagelj, V., & Ferligoj, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511584176 · Cited by 472
Fekete, J.-D. (2005) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.2004.64 · Cited by 261
Self-citationA Spectral Algorithm for Seriation and the Consecutive Ones Problem
Atkins, J. E., Boman, E. G., & Hendrickson, B. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795285771 · Cited by 220
GUESS: a language and interface for graph exploration
Adar, E. (2006) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1124772.1124889 · Cited by 207
Social networks as normal science ∗
Hummon, N. P., & Carley, K. M. (1993) · Social Networks · doi:10.1016/0378-8733(93)90022-d · Cited by 151
A Multi-scale Algorithm for the Linear Arrangement Problem
Koren, Y., & Harel, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36379-3_26 · Cited by 96
Constructing and Reconstructing the Reorderable Matrix
Siirtola, H., & Mäkinen, E. (2005) · Information Visualization · doi:10.1057/palgrave.ivs.9500086 · Cited by 68
Matrix Visualization and Information Mining
Chen, C., Hwu, H., Jang, W.-J., Kao, C., Tien, Y.-J., Tzeng, S., & Wu, H. (2004) · Physica-Verlag eBooks · doi:10.1007/978-3-7908-2656-2_6 · Cited by 21
One-dimensional layout optimization, with applications to graph drawing by axis separation
Koren, Y., & Harel, D. (2005) · Computational Geometry · doi:10.1016/j.comgeo.2005.03.003 · Cited by 9
Cited by
A Nested Model for Visualization Design and Validation
Munzner, T. (2009) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.111 · Cited by 880
Visual comparison for information visualization
Gleicher, M., Albers, D., Walker, R., Jusufi, I., Hansen, C. D., & Roberts, J. C. (2011) · Information Visualization · doi:10.1177/1473871611416549 · Cited by 567
NodeTrix: a Hybrid Visualization of Social Networks
Henry, N., Fekete, J.-D., & McGuffin, M. J. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70582 · Cited by 555
Self-citationVisual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges
von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J. ‐., & Fellner, D. W. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01898.x · Cited by 515
Self-citationHierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines
Elmqvist, N., & Fekete, J.-D. (2010) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.84 · Cited by 381
Self-citation
Metadata
- Authors
- Henry, N., & Fekete, J.-D.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2006-09
- Volume
- 12
- Issue
- 5
- Pages
- 677-684
- ISSN
- 1077-2626 (ISSN-L)
- 1941-0506
- 2160-9306
- OpenAlex
- W2128712108
- Cited by
- 266
- References
- 22
- FWCI
- 18.43
- 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.