InfoVis:Wiki - User contributions [en]

Linking and Brushing

2013-09-08T14:07:43Z

Jean-Daniel Fekete: fix

[[Image:Ggobi04brushlink.png|250px|thumb|Linking and brushing in a scatterplot matrix (image created with [http://www.ggobi.org GGobi]) [Voigt, 2002]]]
{{Quotation|The idea of '''linking and brushing''' is to combine different visualization methods to overcome the shortcomings of single techniques. Interactive changes made in one visualization are automatically reflected in the other visualizations. Note that connecting multiple visualizations through interactive linking and brushing provides more information than considering the component visualizations independently.|[Keim, 2002]}}

{{Quotation|'''Linking and brushing''' are interaction techniques. They can be used to enhance the work with scatterplot matrices, parallel coordinates and many other InfoVis techniques '''Brushing''' means selecting a subset of the data items with an input device (mouse). This is usually done to highlight this subset, but it can also be done to delete it from the view or to de-emphasize it, if the user wants to focus on the other items. Brushing is most interesting in connection with '''linking'''. For instance in a scatterplot matrix, the user could brush some points in one plot. This causes the brush effect (highlighting, etc.) to be applied on those points in the other plots that represent the same data items.|[Voigt, 2002]}}

{{Quotation|By linking, we mean showing how a point, or set of points, behaves in each of the plots. This is accomplished by highlighting these points in some fashion. For example, the highlighted points could be drawn as a filled circle while the remaining points could be drawn as unfilled circles. A typical application of this would be to show how an outlier shows up in each of the individual pairwise plots. Brushing extends this concept a bit further. In brushing, the points to be highlighted are interactively selected by a mouse and the scatterplot matrix is dynamically updated (ideally in real time). That is, we can select a rectangular region of points in one plot and see how those points are reflected in the other plots.|[NIST/SEMATECH, 2004]}}

== References ==

*[Buja et al., 1991]: Andreas Buja, John Alan McDonald, John Michalak, and Werner Stuetzle. 1991. Interactive data visualization using focusing and linking. In Proceedings of the 2nd conference on Visualization '91 (VIS '91), Gregory M. Nielson and Larry Rosenblum (Eds.). IEEE Computer Society Press, Los Alamitos, CA, USA, 156-163.
*[Becker&Cleveland, 1987] Richard A. Becker and William S. Cleveland. 1987. Brushing scatterplots. Technometrics 29, 2 (May 1987), 127-142. DOI=10.2307/1269768 http://dx.doi.org/10.2307/1269768
*[Keim, 2002]: D. A. Keim, Information Visualization and Visual Data Mining, ''IEEE Transactions on Visualization and computer graphics'', 2002.
*[Voigt, 2002]: Robert Voigt, [http://old.vrvis.at/via/resources/DA-RVoigt/DA.pdf An Extended Scatterplot Matrix and Case Studies in Information Visualization], Master's thesis, Hochschule Magdeburg-Stendal, 2002, [http://old.vrvis.at/via/resources/DA-RVoigt/node10.html ''Linking and brushing'']
*[Saake et al., 2000]: Gunter Saake, Kai-Uwe Sattler, Daniel Keim, Datenbank- und Visualisierungstechnologie in der Informationsfusion', Fakultät für Informatik, Universität Magdeburg, 2000.
*[NIST/SEMATECH, 2004]: NIST/SEMATECH, [http://www.itl.nist.gov/div898/handbook/ e-handbook of statistical methods], Retrieved at: November 2004. http://www.itl.nist.gov/div898/handbook/

[[Category: Glossary]]
[[Category: Interaction_Techniques]]

Linking and Brushing

2013-09-08T14:06:37Z

Jean-Daniel Fekete: Adding 2nd ref

[[Image:Ggobi04brushlink.png|250px|thumb|Linking and brushing in a scatterplot matrix (image created with [http://www.ggobi.org GGobi]) [Voigt, 2002]]]
{{Quotation|The idea of '''linking and brushing''' is to combine different visualization methods to overcome the shortcomings of single techniques. Interactive changes made in one visualization are automatically reflected in the other visualizations. Note that connecting multiple visualizations through interactive linking and brushing provides more information than considering the component visualizations independently.|[Keim, 2002]}}

{{Quotation|'''Linking and brushing''' are interaction techniques. They can be used to enhance the work with scatterplot matrices, parallel coordinates and many other InfoVis techniques '''Brushing''' means selecting a subset of the data items with an input device (mouse). This is usually done to highlight this subset, but it can also be done to delete it from the view or to de-emphasize it, if the user wants to focus on the other items. Brushing is most interesting in connection with '''linking'''. For instance in a scatterplot matrix, the user could brush some points in one plot. This causes the brush effect (highlighting, etc.) to be applied on those points in the other plots that represent the same data items.|[Voigt, 2002]}}

{{Quotation|By linking, we mean showing how a point, or set of points, behaves in each of the plots. This is accomplished by highlighting these points in some fashion. For example, the highlighted points could be drawn as a filled circle while the remaining points could be drawn as unfilled circles. A typical application of this would be to show how an outlier shows up in each of the individual pairwise plots. Brushing extends this concept a bit further. In brushing, the points to be highlighted are interactively selected by a mouse and the scatterplot matrix is dynamically updated (ideally in real time). That is, we can select a rectangular region of points in one plot and see how those points are reflected in the other plots.|[NIST/SEMATECH, 2004]}}

== References ==

*[Buja et al., 1991]: Andreas Buja, John Alan McDonald, John Michalak, and Werner Stuetzle. 1991. Interactive data visualization using focusing and linking. In Proceedings of the 2nd conference on Visualization '91 (VIS '91), Gregory M. Nielson and Larry Rosenblum (Eds.). IEEE Computer Society Press, Los Alamitos, CA, USA, 156-163.
[Becker&Cleveland, 1987] Richard A. Becker and William S. Cleveland. 1987. Brushing scatterplots. Technometrics 29, 2 (May 1987), 127-142. DOI=10.2307/1269768 http://dx.doi.org/10.2307/1269768
*[Keim, 2002]: D. A. Keim, Information Visualization and Visual Data Mining, ''IEEE Transactions on Visualization and computer graphics'', 2002.
*[Voigt, 2002]: Robert Voigt, [http://old.vrvis.at/via/resources/DA-RVoigt/DA.pdf An Extended Scatterplot Matrix and Case Studies in Information Visualization], Master's thesis, Hochschule Magdeburg-Stendal, 2002, [http://old.vrvis.at/via/resources/DA-RVoigt/node10.html ''Linking and brushing'']
*[Saake et al., 2000]: Gunter Saake, Kai-Uwe Sattler, Daniel Keim, Datenbank- und Visualisierungstechnologie in der Informationsfusion', Fakultät für Informatik, Universität Magdeburg, 2000.
*[NIST/SEMATECH, 2004]: NIST/SEMATECH, [http://www.itl.nist.gov/div898/handbook/ e-handbook of statistical methods], Retrieved at: November 2004. http://www.itl.nist.gov/div898/handbook/

[[Category: Glossary]]
[[Category: Interaction_Techniques]]

Linking and Brushing

2013-09-08T14:01:31Z

Jean-Daniel Fekete: Added historical reference

[[Image:Ggobi04brushlink.png|250px|thumb|Linking and brushing in a scatterplot matrix (image created with [http://www.ggobi.org GGobi]) [Voigt, 2002]]]
{{Quotation|The idea of '''linking and brushing''' is to combine different visualization methods to overcome the shortcomings of single techniques. Interactive changes made in one visualization are automatically reflected in the other visualizations. Note that connecting multiple visualizations through interactive linking and brushing provides more information than considering the component visualizations independently.|[Keim, 2002]}}

{{Quotation|'''Linking and brushing''' are interaction techniques. They can be used to enhance the work with scatterplot matrices, parallel coordinates and many other InfoVis techniques '''Brushing''' means selecting a subset of the data items with an input device (mouse). This is usually done to highlight this subset, but it can also be done to delete it from the view or to de-emphasize it, if the user wants to focus on the other items. Brushing is most interesting in connection with '''linking'''. For instance in a scatterplot matrix, the user could brush some points in one plot. This causes the brush effect (highlighting, etc.) to be applied on those points in the other plots that represent the same data items.|[Voigt, 2002]}}

{{Quotation|By linking, we mean showing how a point, or set of points, behaves in each of the plots. This is accomplished by highlighting these points in some fashion. For example, the highlighted points could be drawn as a filled circle while the remaining points could be drawn as unfilled circles. A typical application of this would be to show how an outlier shows up in each of the individual pairwise plots. Brushing extends this concept a bit further. In brushing, the points to be highlighted are interactively selected by a mouse and the scatterplot matrix is dynamically updated (ideally in real time). That is, we can select a rectangular region of points in one plot and see how those points are reflected in the other plots.|[NIST/SEMATECH, 2004]}}

== References ==

*[Buja et al., 1991]: Andreas Buja, John Alan McDonald, John Michalak, and Werner Stuetzle. 1991. Interactive data visualization using focusing and linking. In Proceedings of the 2nd conference on Visualization '91 (VIS '91), Gregory M. Nielson and Larry Rosenblum (Eds.). IEEE Computer Society Press, Los Alamitos, CA, USA, 156-163.
*[Keim, 2002]: D. A. Keim, Information Visualization and Visual Data Mining, ''IEEE Transactions on Visualization and computer graphics'', 2002.
*[Voigt, 2002]: Robert Voigt, [http://old.vrvis.at/via/resources/DA-RVoigt/DA.pdf An Extended Scatterplot Matrix and Case Studies in Information Visualization], Master's thesis, Hochschule Magdeburg-Stendal, 2002, [http://old.vrvis.at/via/resources/DA-RVoigt/node10.html ''Linking and brushing'']
*[Saake et al., 2000]: Gunter Saake, Kai-Uwe Sattler, Daniel Keim, Datenbank- und Visualisierungstechnologie in der Informationsfusion', Fakultät für Informatik, Universität Magdeburg, 2000.
*[NIST/SEMATECH, 2004]: NIST/SEMATECH, [http://www.itl.nist.gov/div898/handbook/ e-handbook of statistical methods], Retrieved at: November 2004. http://www.itl.nist.gov/div898/handbook/

[[Category: Glossary]]
[[Category: Interaction_Techniques]]

2009-06-16: Job Offer: 1-2 Years Engineer Position to Design Java Interfaces for Interoperability between InfoVis Toolkits (data model, IO, Layout, etc.), INRIA, Paris, France

2009-06-16T15:02:30Z

Jean-Daniel Fekete:

=''''Research Position (INRIA, Orsay (near Paris), France)'''=

[[Category:Jobs]]
[[Category:2009/06]]

The [http:///www.aviz.fr INRIA AVIZ Research Team (France)] is seeking an engineer who graduated recently (less than 2 years ago) to work on an open source project for the InfoVis community.

The engineer will be in charge of designing, testing and documenting Java Interfaces and class for foster interoperability between the various InfoVis toolkits and applications. The goal is to avoid all the InfoVis projects to re-implement the same components again and again (data loading and saving, layouts, etc.) by providing clean and simple abstractions (interfaces). These abstractions should be easy to implement by InfoVis system implementors and efficient enough. Some initial work has been done and the project is supported by several major contributors in the InfoVis community (see the [http://code.google.com/p/obvious Obvious project at Google Code]).

===RESPONSIBILITIES===

You will
* Define Java interfaces that will be implemented by lots of InfoVis implementations
* Test and document the interfaces with additional supporting classes and components
* Interact with leading researchers and companies to validate your designs (Microsoft Research, IBM, Google, SAP, Stanford Univ., Univ. of Oklahoma, INRIA, etc.)
* Work within a creative and recognized Research Group

==REQUIRED QUALIFICATIONS==

You
* Graduated in the last 2 years (Master or PhD level)
* Are proficient in Information Visualization
* Are proficient in Java
* Have done substantial coding
* Like interacting with InfoVis researchers and practitioners (in English, French is not required)

Closing date for application: August 30th 2009

Application site: [http://www.inria.fr/travailler/opportunites/jeunes.en.html INRIA Applications]

The application starts October 1st 2009. If you have more questions, please, ask: 
Jean-Daniel Fekete 
AVIZ Project-Team 
INRIA Saclay - Île-de-France 
Jean-Daniel.Fekete@inria.fr

=Background: INRIA and AVIZ=

[http://www.inria.fr INRIA] is a leading research institute in France and known worldwide for its excellence in Computer Science. [http://www.aviz.fr AVIZ] is a research team of INRIA specialized in Visual Analytics and Information Visualization. It is lead by [http://www.aviz.fr/~fekete Jean-Daniel Fekete] who is a well known research in InfoVis and HCI, author of the InfoVis Toolkit and [http://www.aviz.fr/~fekete/ps several scientific articles].

2009-06-16: Job Offer: 1-2 Years Engineer Position to Design Java Interfaces for Interoperability between InfoVis Toolkits (data model, IO, Layout, etc.), INRIA, Paris, France

2009-06-16T15:00:24Z

Jean-Daniel Fekete: New page: =''''Research Position (INRIA, Orsay (near Paris), France)'''= Category:Jobs Category:2009/06 The [http:///www.aviz.fr INRIA AVIZ Research Team (France)] is seeking an engineer w...

=''''Research Position (INRIA, Orsay (near Paris), France)'''=

[[Category:Jobs]]
[[Category:2009/06]]

The [http:///www.aviz.fr INRIA AVIZ Research Team (France)] is seeking an engineer who graduated recently (less than 2 years ago) to work on an open source project for the InfoVis community.

The engineer will be in charge of designing, testing and documenting Java Interfaces and class for foster interoperability between the various InfoVis toolkits and applications. The goal is to avoid all the InfoVis projects to re-implement the same components again and again (data loading and saving, layouts, etc.) by providing clean and simple abstractions (interfaces). These abstractions should be easy to implement by InfoVis system implementors and efficient enough. Some initial work has been done and the project is supported by several major contributors in the InfoVis community (see the [http://code.google.com/p/obvious Obvious project at Google Code]).

===RESPONSIBILITIES===

You will
* Define Java interfaces that will be implemented by lots of InfoVis implementations
* Test and document the interfaces with additional supporting classes and components
* Interact with leading researchers and companies to validate your designs (Microsoft Research, IBM, Google, SAP, Stanford Univ., Univ. of Oklahoma, INRIA, etc.)
* Work within a creative and recognized Research Group

==REQUIRED QUALIFICATIONS==

You
* Graduated in the last 2 years (Master or PhD level)
* Are proficient in Information Visualization
* Are proficient in Java
* Have done substantial coding
* Like interacting with InfoVis researchers and practitioners (in English, French is not required)

Closing date for application: August 1st 2009

Application site: [http://www.inria.fr/travailler/opportunites/jeunes.en.html INRIA Applications]

The application starts October 1st 2009. If you have more questions, please, ask: 
Jean-Daniel Fekete 
AVIZ Project-Team 
INRIA Saclay - Île-de-France 
Jean-Daniel.Fekete@inria.fr

=Background: INRIA and AVIZ=

[http://www.inria.fr INRIA] is a leading research institute in France and known worldwide for its excellence in Computer Science. [http://www.aviz.fr AVIZ] is a research team of INRIA specialized in Visual Analytics and Information Visualization. It is lead by [http://www.aviz.fr/~fekete Jean-Daniel Fekete] who is a well known research in InfoVis and HCI, author of the InfoVis Toolkit and [http://www.aviz.fr/~fekete/ps several scientific articles].

Template:News

2009-06-16T14:26:48Z

Jean-Daniel Fekete:

*[[2009-06-16: Job Offer: 1-2 Years Engineer Position to Design Java Interfaces for Interoperability between InfoVis Toolkits (data model, IO, Layout, etc.), INRIA, Paris, France]]
*[[2009-06-10: Job Offer: PhD candidate fo the research project VIENA (Visual Enterprise Network Analytics), Danube University Krems, Austria]]
*[[2009-06-03: Job Offer: Postdoc in Relational and Multivariate Information Visualization, Groningen, the Netherlands]]
*[[2009-05-19: CFP: InfoVis Discovery Exhibition]]
*[[2009-04-01: Web-based study on visual search]]
*[[2009-03-31: Job: 2 PhD and 1 PostDoc position at INRIA Bordeaux, France]]
*[[2009-03-03: Job: Post-Doctoral Fellowship in Geo Visual Analytics, Memorial University, Canada]]
*[[2009-02-27: Job: Summer internship at i2, Cambridge UK]]
*[[2009-02-21: CFP: VizSec 2009 Workshop on Visualization for Cyber Security]]
*[[2009-02-04: Job Offer: Information Visualization Researcher, New York, USA]]
*[[2009-01-26: Job Offer: PhD Position in Information Visualization, Växjö University, Sweden, and TU Kaiserslautern, Germany]]
*[[2009-01-10: WikIT, a wiki on information mapping, is now open]]
*[[2008-12-19: Job: Postdoc in Visual Perception, Delft University of Technology, The Netherlands]]
*[[2008-12-19: Job: PostDoc/PhD position in Visualization and Analysis of Analytical Data, Vienna Univ. of Technology, Austria]]
*[[2008-12-18: CFP: Information Visualization in Biomedical Informatics at IV'09 - July 15, 2009, Barcelona, Spain]]
*[[2008-12-17: CFP for Special Session on Visualization and Collaboration at CTS'09]]
*[[2008-12-15: Job Offer: PostDoc in Visualization at University of Bergen, Norway]]
*[[2008-12-15: What Jobs Are There in Data Visualization?]]
*[[2008-12-11: 1st International Symposium Information Visualization Evaluation (IVE) Call for Papers]]
*[[2008-12-04: Job Offer: Data Analysis and Visual Analytics Ph.D. Fellowships at UNC Charlotte and Georgia Tech]]
*[[2008-12-03: Job Offer: visual and algorithmic analysis of movement and event data, Univ. Bonn]]
*[[2008-11-27: Job Offer: University of Milan is seeking two PhD students]]
*[[2008-10-27: Parsons Journal for Information Mapping (PJIM): Call for Papers and Projects]]
*[[2008-10-21: Live coverage of VisWeek 2008]]
*[[2008-10-20: CFP: Workshop on Collaborative Information Visualization On Interactive Surfaces]]
*[[2008-10-20: 14 Misconceptions About Charts and Graphs]]
*[[2008-10-17: Presentation of Eric Rodenbeck, "information Visualization Is A Medium"]]
*[[2008-10-14: WET: The Website Exploration Tool demo still available at www.infovis.net]]
*[[2008-10-10: BirdEye: visual analytics API under development]]
*[[2008-10-09: Open Position: Visualization Research Scientist at Agilent Laboratories]]
*[[2008-10-02: Job Offer: PhD position in Collaborative Visual Analytics]]
*[[2008-09-03: Job Offer: Tenure-Track Position in Interactive Visual Media at Arizona State University]]
[[Image:Ogawa08codeswarm.png|right|100px]]
*[[2008-08-26: code_swarm - Dynamic visualization of Open Source Software project evolution]]
*[[2008-07-21: Visual Thinking Taxonomy v5.0]]
*[[2008-07-17: Job Offer: Full Professor of (Scientific) Visualisation at University of Vienna]]
[[Image:Ivda_fish-image_web.jpg|right|100px]]
*[[2008-07-03: New educational program on "Interactive Visualization and Data Analysis"]]
*[[2008-06-23: IEEE VisWeek 2008 - 2nd Call for participation]]
*[[2008-06-20: VizSec 2008 - Call for Posters and Demonstrations]]
*[[2008-06-09: IEEE VisWeek 2008 - Call for Student Volunteers]]
*[[2008-06-06: PhD position "An interactive personal assistant for document visualization during meetings" at IDIAP Research Institute, Martigny, Switzerland]]
*[[2008-06-03: Seminar on Interactive Visualization and Data Analysis (in German) at Danube University Krems, Austria]]
*[[2008-06-03: Job Offer: PhD Position in Information Visualization, Växjö University, Sweden, and TU Kaiserslautern, Germany]]
*[[2008-05-27: Four 4(!) open PhD Fellowship Positions]], [http://www.ii.UiB.no/vis/ www.ii.UiB.no/vis], application deadline June 10th, 2008
*[[2008-05-20: Open Position: Designer / Developer for Interactive Visualizations - June 14th 2008]]
*[[2008-05-12: ICAART 2009: Full Paper Submission: July 22 , 2008]]
*[[2008-04-22: Doctoral Positions at Fraunhofer IAIS]]
*[[2008-06-15: Interactive Visualization for Computational Linguistics Tutorial at ACL/HLT '08]]
*[[2008-04-10: CFP: VizSEC 2008 Update]]
*[[2008-03-17: Vis, InfoVis, VAST 2008 Abstract Deadline is coming up]]
*[[2008-03-14: Review Volunteering for Vis, InfoVis, VAST]]
*[[2008-03-10: CFP: Special Issue of IEEE Computer Graphics and Applications (CG&A) on Visual Analytics Evaluation]]
*[[2008-03-10: VAST Challenge 2008 announced]]
*[[2008-03-10: SEMVAST: New Resource on Visual Analytics Evaluation]]
*[[2008-03-06: CFP: Geospatial Visual Analytics, Workshop and Special Issue of the CaGIS journal]]
*[[2008-03-06: Call for Participation: Interactive Visual Exploration of Electronic Health Records Workshop]]
*[[2008-03-05: BIOSTEC 2009: Full Paper Submission: June 27, 2008]]
*[[2008-03-03: Bergen Job Offer: PhD Fellowship in MedVis]]
*[[2008-02-20: InfoVis:Wiki will be temporarily down for maintenance today]]
*[[2008-02-06: New book "Visualization for Information Retrieval" by Jin Zhang]]
*[[2008-01-19: New issue of Inf@Vis! (infovis.net) on "Intelligent Legends" available]]
*[[2008-01-19: Job Offer: Tenured faculty position in HCI at the University of Zurich]]
*[[2008-01-16: Assistant Professor in New Media Technology; MODUL University Vienna, Austria]]
*[[2008-01-16: Job Offer: PhD Position in Information Visualization, Växjö University, Sweden, and TU Kaiserslautern, Germany]]
*[[2007-12-31: CFP:Symposium on Information Visualization in Biomedical Informatics]]
*[[2007-12-27: CFP: Computer Graphics International Conference; Special Issue: The Visual Computer]]
*[[2007-12-21: CFP: VizSEC 2008 Workshop on Visualization for Cyber Security]]
*[[2007-12-18: Draft Classification headings for InfoVis]]
[[Image:Heer07flare.png|right|100px]]
*[[2007-12-05: United Nations Office at Geneva: Centre for Advanced Visual Analytics]]
*[[2007-12-05: flare: A new prefuse-based visualization toolkit for ActionScript and the Adobe Flash Player]]
*[[2007-11-22: CFP: GeoVisualization of Dynamics, Movement and Change, Workshop and Special Issue of the Information Visualization journal]]
*[[2007-11-09: Job Offer: Post-Doc Position Available at the University of Calgary]]
*[[2007-11-09: CFP: Visualization and Collaboration, Special Session to be held at The 2008 International Symposium on Collaborative Technologies and Systems]]
*[[2007-11-09: Job Offer: PhD position in InfoVis and adaptive eLearning technologies, University of Lugano, Switzerland]]
*[[2007-10-31: Job Offer: Research and Teaching Position, Danube University Krems, Austria]]
*[[2007-10-30: CFP: Visualization for Decision Making, Information Sharing, and Collaboration (ISCRAM 2008)]]
*[[2007-10-27: Skyrails: Social Network Visualisation System]]
*[[2007-10-18: InfoVis:Wiki and VizPatterns Merger]]
*[[2007-10-08: Job Offer: PhD Position in Information Visualization, Växjö University, Sweden]]
*[[2007-09-26: Research Fellow in Visualization (2 positions), Bergen, Norway]]
*[[2007-09-24: Job Offers: Researchers and PhD Candidates, Info Viz (Information Landscapes), Vienna, Austria]]
*[[2007-09-20: VizPatterns.org Wiki announces a new resource for Visualization Design Patterns]]
*[[2005-09-18: IEEE OnAV08 Call for Papers (Intl. Workshop on Ontology Alignment and Visualization)]]
*[[2007-09-12: InfoVis:Wiki RSS feeds now working properly!]]
*[[2007-09-11: IEEE CG&A Call for Papers - Special issue on "Mobile Graphics", July-August 2008]]
*[[2007-09-10: Post-doc job offer in "Visual Analytics" at INRIA / Paris, France]]
*[[2007-09-07: System upgrade and new server for the InfoVis:Wiki]]
*[[2007-09-05: Job Offer: KTP associate in Information Visualisation (Oxford, UK)]]
*[[2007-08-31: InfoVis:Wiki will be upgraded and moved during the upcoming week]]
*[[2007-08-30: InfoVis job opportunities in HealthCare at Humana Innovation Center]]
*[[2007-08-30: InfoVis job opportunities at IBM China Research Lab]]
*[[2007-08-21: Open-source interface to search, browse, and data-mine image collections]]
*[[2007-08-01: Oculus Info Inc hiring information visualization experts]]
* 2007-07-24: [[BIOSTEC 2008]] - Deadline Position papers: 10 September, 2007
*[[2007-07-19: IJGIS Special issue Geovisual analytics for spatial decision support]]
*[[2007-07-10: Job Offer: KTP associate in Information Visualisation (Oxford, UK)]]
*[[2007-07-03: Review of visualization techniques for temporal information]]
*[[2007-06-28: Job offer: Researcher/Lecturer in Information Vizualization (Vienna, Austria)]]
*[[2007-06-25: Inforgraphics For The SEO Confused]]
*2007-06-22: [http://www.biostec.org/ BIOSTEC 2008]: Full paper submission ends at June, 27 of 2007
*[[2007-06-17: searchCrystal, a search visualization toolset, is available at www.searchcrystal.com]]
*[[2007-06-06: PhD Scholarships at University Konstanz (Germany)]]
*[[2007-06-05: Post-Doctoral position in GeoVisualization at the giCentre, City University]]
*[[2007-06-01: Postdoctoral position in information visualization at Stony Brook University]]
*[[2007-05-18: Post-doctorate Research Position in Information Visualization]]
*[[2007-05-18: Do you know the difference between good and bad graph designs?]]
*[[2007-05-07: Anonymous editing disallowed on InfoVis:Wiki due to SPAM]]
*[[2007-04-20: Review of the newly released Tableau 3.0 by Stephen Few]]
*[[2007-04-19: Funded PhD position in InfoVis at Napier University, Edinburgh, UK]]
*[[2007-04-16: Historic Information Graphics literature review by Aaron Marcus]]
*[[2007-03-10: "ShoppingPath": novel Shopping Visualization Tool]]
*[[2007-03-02: Google Custom Search Engine for Data Visualization]]
[[Image:Lengler07periodic-table.jpg|right|75px]]
*[[2007-02-28: A Periodic Table of Visualization Methods]]
*[[2007-02-28: "visual-literacy.org": An E-Learning Tutorial on Visualization for Communication, Engineering and Business]]
[[Image:Manyeyes07logo.jpg|right|75px]]
*[[2007-02-19: "Many Eyes": New web application for shared visualization and discovery by Martin Wattenberg et al.]]
[[Image:Engelhardt07infovis-diagram.gif|right|100px]]
*[[2007-02-15: New issue of Inf@Vis! (infovis.net) on "InfoVis Diagram" available]]
*[[2007-01-22: JavaOne Online Learning Resource on "NetBeans IDE Common Framework for Information Visualization"]]
*[[2007-01-11: New issue of Inf@Vis! (infovis.net) on "Diagrams for Visualisation" available]]
*[[2006-12-07: New issue of Inf@Vis! (infovis.net) on "Exploratory Search" available]]
*[[2006-12-06: Research and Teaching Position at Danube University Krems, Austria]]
*[[2006-12-06: Is There Science in Visualization?]]
*[[2006-12-04: "Discovering the Unexpected" - Call for Papers: Visual Analytics in IEEE CG&A]]
*[[2006-11-29: Stephen Few comments on InfoVis 2006 conference]]
*[[2006-11-13: Presentation of InfoVis:Wiki at Wikiposium 2006]]
*[[2006-10-30: New release of XmdvTool is available (7.0)]]
*[[2006-10-23: New issue of Inf@Vis! (infovis.net) on "Colour guidelines" available]]
*[[2006-09-28: InfoVis'06 Papers on the Web ]]
*[[2006-09-28: Job offer: 4 Research Positions in Visualization & Semantic Systems at Graz University of Technology and Vienna University of Economics and Business Administration, Austria]]
*[[2006-09-20: New issue of Inf@Vis! (infovis.net) on "Colour Usage" available]]
*[[2006-08-28: "Simplicity - the art of complexity" is the theme of this years Ars Electronica Festival in Linz, Austria]]
*[[2006-08-01: Job openings at IBM T, J. Watson: Research Staff Member]]
*[[2006-07-24: Post-doc job offer at for "Interactive and Visual Graph Mining" at INRIA / Bordeaux, France]]
*[[2006-06-27: Post-Doc / PhD Position at MPI Tuebingen]]
*[[2006-06-02: Ph.D. Fellowships in Visual Analytics available at Worcester Polytechnic Institute Computer Science Department]]
*[[2006-05-29: Oculus Info Inc hiring information visualization experts]]
[[Image:Aharef06websitegraph.png|right|100px]]
*[[2006-05-29: Websites as graphs]]
[[Image:Offenhuber06semaspace.jpg|right|100px]]
*[[2006-05-24: SemaSpace - Graph editor for large knowledge networks]]
*[[2006-05-21: Junk Charts - New Blog on chart junk]]
*[[2006-05-15: Open Lecture on "Complexity and Infoviz", Design Faculty of Polietcnico di Milano. Milan, Italy]]
*[[2006-04-24: Open Research and Teaching Assistant/PhD Candidate position at Danube University Krems, Austria]]
*[[2006-04-20: Call for Papers - C&G Special Issue on Visual Analytics]]
*[[2006-04-19: "The Surest Path to Visual Discovery" - Article by Stephen Few illustrating the Visual Information Seeking Mantra]]
*[[2006-04-18: New issue of Inf@Vis! (infovis.net) on "Visualising Time" available]]
[[Image:Google06finance.png|right|100px]]
*[[2006-03-27: Google Finance - Interactive Flash graphs to explore stock price data]]
[[Image:Smartmoney06marketradar.gif|right|100px]]
*[[2006-03-27: Market Radar: interactive data visualization of historical stock prices at SmartMoney.com]]
*[[2006-03-21: Post-doctoral position at CNRS, LaBRI, Bordeaux, France]]
*[[2006-03-20: Webcast by Ben Shneiderman on Information Exploration]]
*[[2006-03-15: Information Visualization Post-Doc and Summer Internship Positions at INRIA (France)]]
*[[2006-03-14: Article on Chart Junk: "Ice Age, or How to Avoid Frightening your Readers by Hiding the Key Data Point"]]
*[[2006-03-10: Visual Information Expert Workshop]]
*[[2006-03-08: The new book "Beautiful Evidence" by E. Tufte will be available soon]]
*[[2006-03-06: Article on "Visual Analytics" in current issue of IEEE Computer Graphics and Applications]]
*[[2006-02-26: Submission Deadline of IV06 has been extended to March 20, 2006]]
*[[2006-02-16: New issue of Inf@Vis! (infovis.net) on "Preattentive Processing" available]]
[[Image:Carden06travel time tube map.png|right|100px]]
*[[2006-01-25: Travel Time Tube Map]]
*[[2006-01-17: IEEE Information Visualization Symposium Proceedings will appear as an issue of IEEE Transactions on Visualization and Computer Graphics (TVCG)]]
*[[2006-01-11: Article on "Visualizing Spreadsheets" in DMReview magazine]]

[[:Category:News|'''News Archive...''']]

[http://www.infovis-wiki.net/index.php?title=Special:Newsfeed&feed=rss News as RSS feed]
 [[InfoVis:Wiki_RSS_Feeds|List of all available RSS feeds]]

Category:Methods

2008-12-31T14:07:01Z

Jean-Daniel Fekete: New page: Methods in Information Visualization

Methods in Information Visualization

Social Network Generation

2008-12-31T14:06:21Z

Jean-Daniel Fekete:

This wiki page is under construction...

Research work and images have been realised by Nathalie Henry and Jean-Daniel Fekete, using MatrixExplorer, built with the Infovis Toolkit.

== Social Network Characterization ==

Social networks involve persons or groups called actors and relationship between them, with a lot of variety in the kind of actors and relationships. As described in Wasserman and Faust, actors can be people, subgroups, organizations or collectivities; relations may be friendship (relationships), interactions, communications, transactions, movement or kinship. However, the nature of actors and relations does not really matter: we focus on their structure. We can classify the social networks studied in the literature in three categories:
* Tree-like are trees with additional links forming cycles with a specified probability. This category includes genealogy data and very sparse graphs such as Sexually-Transmitted Disease (STD) transmission patterns. We call them “almost trees” because they have are mostly acyclic and nodes have very few parents.
* Almost complete graphs are complete graphs with missing relations. For example, data about trade between countries, cities or companies are almost complete graphs. They are interesting to study as valued graphs; since they usually carry values on their edges.
* Small-world networks (also scale-free or power-law degree-distribution networks) have been studied intensely since they were first described in Watts and Strogatz. They defined them as graphs with three properties: power-law degree distribution, high clustering coefficient and small average shortest path. They are locally dense (sparse with dense sub-graphs).

Three methods exist to select datasets for assessing the quality of analysis systems in the context of social networks: selecting one or two real datasets hoping they are representative, selecting several datasets or generating random datasets with well-known characteristics shared by social networks. With this last method, one should generate datasets with a controlled set of properties and evaluate the systems knowing the properties in advance. It should then eliminate biases linked to a particular dataset and eases the replication of experiments. Unfortunately, while generating tree-like and almost-complete graphs is relatively straightforward, generating graphs with a small-world network structure is still a research topic for computer scientists and physicists. This page shows the results of popular and available network generators. In light of the real social networks we present in the [[#Real Social Networks]], we consider them unsuitable for evaluations since users can easily notice their artifical nature.

== Issues on Social Network Generation for Evaluating Visualizations ==

Watts and Strogatz first described in (Watts, D. J. and S. H. Strogatz (1998). "Collective dynamics of 'small-world' networks." Nature 393: 440 - 442) the concept of small-world networks. They formalized these networks as graphs with three properties: power-law degree distribution, high clustering coefficient and small average shortest path. In the same paper they propose a basic model fitting these properties consisting in a grid (fixed local neighborhood) with additional links simulating some unexpected relations support to the six degrees of separation discovered by Milgram (Milgram, S. (1967). "The small world problem." Psychology Today: 60-67). Barabási and Albert proposed an incremental model to improve it (Barabási, A.-L. and R. Albert (1999). "Emergence of Scaling in Random Networks." Science 286(5439): 509 - 512.
). Since Watts and Strogatz’ model, several have been proposed each generating networks with one or two of the described properties (power-law) but none combine the three of them.

Here are some results of available generators present in the JUNG package. Let's note that for each network generated we only keep the biggest component. Generators present in Pajek[http://vlado.fmf.uni-lj.si/pub/networks/pajek/] and Geomi[http://www.cs.usyd.edu.au/~visual/valacon/geomi/] are incremental scale-free networks generators such as the Barabasi and Albert model.

=== About datasets and representations ===

* All datasets are downloadable in GraphMl format.
* Node-Link diagrams are ordered with the linLog algorithm of Andreas Noack [Graph Drawing 2005] (with edge-repulsion coefficient of 2.5f).
* Matrices are shown both with the initial order (middle image) and reordered with the TSP-Based algorithm (right image) described by Henry and Fekete [Infovis 2006].

=== Small-World Generators ===

WattsBetaSmallWorldGenerator

Parameters:
'''numVertices''' (the number of nodes in the ring lattice), '''beta''' (the probability of an edge being rewired randomly; the proportion of randomly rewired edges in a graph) and '''degree'''( the number of edges connected to each vertex; the local neighborhood size). Degree must be even.

{| border="1"
| Parameters and Resulting Graph characteristics
|-
| graphs || W1 ||W2|| W3 || W4 ||W5 ||W6||W7||W8||W9||W10||W11||W12
|- style="background:lightgrey;"
|'''numVertices'''||47||47||47||47||47||47||47||47||47||47||47||'''94'''
|- style="background:lightgrey;"
|'''beta'''||'''0.1'''||'''0.3'''||'''0.5'''||'''0.7'''||'''0.9'''||0.3||0.3||0.3||0.3||'''0.7'''||'''0.1'''||0.1
|- style="background:lightgrey;"
|'''degree'''||6||6||6||6||6||'''2'''||'''4'''||'''8'''||'''10'''||'''4'''||'''8'''||8
|-
|numVertices||47||47||47||47||47||47||47||47||47||47||47||94
|-
|numEdges||282||282||282||282||282||94||188||376||470||188||376||752
|-
|components||1||1||1||1||1||2||1||1||1||1||1||1
|- style="background:#FFFFCC"
|density||0.36||0.36||0.36||0.36||0.36||0.21||0.29||0.41||0.46||0.29||0.41||'''0.29'''
|-style="background:#FFFFCC"
|clusteringCoefficient||0.51||0.25||0.15||0.09||0.12||0.23||0.25||0.32||0.38||0.07||0.53||'''0.52'''
|-
|diameter||6||4||4||4||4||-||6||4||3||5||5||6
|-
|averageShortestDistance||2.97||2.4||2.32||2.3||2.29||-||3.24||2.15||1.98||2.83||2.56||3.15
|-
|minDegree||5||4||4||3||4||1||2||5||8||2||7||6
|-
|maxDegree||8||9||9||9||9||4||6||10||13||8||10||10
|}

W1 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.1_6.xml SmallWorld_47_0.1_6.xml]

[[image:wSmallWorld_47_0.1_6.JPG|150px]]
[[image:wSmallWorldMInit_47_0.1_6.PNG|165px]]
[[image:wSmallWorldM_47_0.1_6.JPG|165px]]

W2 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.3_6.xml SmallWorld_47_0.3_6.xml]

[[image:wSmallWorld_47_0.3_6.JPG|150px]]
[[image:wSmallWorldMInit_47_0.3_6.PNG|165px]]
[[image:wSmallWorldM_47_0.3_6.PNG|165px]]

W3 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.5_6.xml SmallWorld_47_0.5_6.xml]

[[image:wSmallWorld_47_0.5_6.JPG|150px]]
[[image:wSmallWorldMInit_47_0.5_6.PNG|165px]]
[[image:wSmallWorldM_47_0.5_6.PNG|165px]]

W4 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.7_6.xml SmallWorld_47_0.7_6.xml]

[[image:wSmallWorld_47_0.7_6.JPG|150px]]
[[image:wSmallWorldMInit_47_0.7_6.PNG|165px]]
[[image:wSmallWorldM_47_0.7_6.PNG|165px]]

W5 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.9_6.xml SmallWorld_47_0.9_6.xml]

[[image:wSmallWorld_47_0.9_6.JPG|150px]]
[[image:WSmallWorldMInit_47_0.9_6.PNG|165px]]
[[image:WSmallWorldM_47_0.9_6.PNG|165px]]

W6 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.3_2.xml SmallWorld_47_0.3_2.xml]

[[image:wSmallWorld_47_0.3_2.JPG|150px]]
[[image:WSmallWorldMInit_47_0.3_2.PNG|165px]]
[[image:WSmallWorldM_47_0.3_2.PNG|165px]]

W7 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.3_4.xml SmallWorld_47_0.3_4.xml]

[[image:wSmallWorld_47_0.3_4.JPG|150px]]
[[image:WSmallWorldMInit_47_0.3_4.PNG|165px]]
[[image:WSmallWorldM_47_0.3_4.PNG|165px]]

W8 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.3_8.xml SmallWorld_47_0.3_8.xml]

[[image:wSmallWorld_47_0.3_8.JPG|150px]]
[[image:WSmallWorldMInit_47_0.3_8.PNG|165px]]
[[image:WSmallWorldM_47_0.3_8.PNG|165px]]

W9 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.3_10.xml SmallWorld_47_0.3_10.xml]

[[image:wSmallWorld_47_0.3_10.JPG|150px]]
[[image:WSmallWorldMInit_47_0.3_10.PNG|165px]]
[[image:WSmallWorldM_47_0.3_10.PNG|165px]]

W10 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.7_4.xml SmallWorld_47_0.7_4.xml]

[[image:wSmallWorld_47_0.7_4.JPG|150px]]
[[image:wSmallWorldMInit_47_0.7_4.PNG|165px]]
[[image:wSmallWorldM_47_0.7_4.PNG|165px]]

W11 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_47_0.1_8.xml SmallWorld_47_0.1_8.xml]

[[image:wSmallWorld_47_0.1_8.JPG|150px]]
[[image:wSmallWorldMInit_47_0.1_8.PNG|165px]]
[[image:wSmallWorldM_47_0.1_8.PNG|165px]]

W12 [http://insitu.lri.fr/~nhenry/socnets/wsmallworld/wSmallWorld_94_0.1_8.xml SmallWorld_94_0.1_8.xml]

[[image:wSmallWorld_94_0.1_8.JPG|150px]]
[[image:wSmallWorldMInit_94_0.1_8.PNG|165px]]
[[image:wSmallWorldM_94_0.1_8.PNG|165px]]

KleinbergSmallWorldGenerator

Parameters:'''latticeSize''' (the lattice size (length of row or column dimension)) and '''clusteringExponent''' (the clustering exponent parameter).

{| border="1"
| Parameters and Resulting Graph characteristics
|-
| graphs || W1 ||W2|| W3 || W4 ||W5 ||W6||W7||W8||W9||W10||W11
|- style="background:lightgrey;"
|'''latticeSize''' || 7 || 7 || 7 || 7 || 7 || 7 || 7 || '''10''' || '''10''' || '''10''' || '''10'''
|- style="background:lightgrey;"
|'''clusteringExponent''' ||'''0.1''' || '''0.5''' || '''1'''|| '''2''' || '''2.5''' || '''4''' || '''8''' || '''2''' || '''4''' || '''8''' || '''12'''
|-
|numVertices || 49 || 49 || 49 || 49 || 49 || 49 || 49 || 100 || 100 || 100 || 100
|-
|numEdges || 490 || 490 || 490 || 490 || 490 || 490 || 490 || 1000 || 1000 || 1000 || 1000
|-
|components || 1 || 1 || 1 || 1 || 1 || 1 || 1 || 1 || 1 || 1 || 1
|- style="background:#FFFFCC"
|density || 0.45 || 0.45 || 0.45 || 0.45 || 0.45 || 0.45 || 0.45 || 0.32 || 0.32 || 0.32 || 0.32
|-style="background:#FFFFCC"
|clusteringCoefficient || 0.08 || 0.09 || 0.14 || 0.19 || 0.19 || 0.26 || 0.32 || 0.18 || 0.23 || 0.32 || 0.33
|-
|diameter || 4 || 4 || 4 || 4 || 4 || 5 || 5 || 5 || 6 || 7 || 7
|-
|averageShortestDistance || 2.38 || 2.36 || 2.37 || 2.44 || 2.48 || 2.54 || 2.73 || 3.1 || 3.57 || 3.65 || 3.68
|-
|minDegree || 9 || 9 || 9 || 9 || 9 || 9 || 9 || 9 || 9 || 9 || 9
|-
|maxDegree || 14 || 12 || 13 || 12 || 12 || 13 || 12 || 13 || 13 || 14 || 12
|}

W1 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_0.1.xml SmallWorld_49_0.1.xml]

[[image:kSmallWorld_49_0.1.PNG|150px]]
[[image:kSmallWorldMInit_49_0.1.PNG|165px]]
[[image:kSmallWorldM_49_0.1.PNG|165px]]

W2 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_0.5.xml SmallWorld_49_0.5.xml]

[[image:kSmallWorld_49_0.5.PNG|150px]]
[[image:kSmallWorldMInit_49_0.5.PNG|165px]]
[[image:kSmallWorldM_49_0.5.PNG|165px]]

W3 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_1.0.xml SmallWorld_49_1.0.xml]

[[image:kSmallWorld_49_1.0.PNG|150px]]
[[image:kSmallWorldMInit_49_1.0.PNG|165px]]
[[image:kSmallWorldM_49_1.0.PNG|165px]]

W4 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_2.0.xml SmallWorld_49_2.0.xml]

[[image:kSmallWorld_49_2.0.PNG|150px]]
[[image:kSmallWorldMInit_49_2.0.PNG|165px]]
[[image:kSmallWorldM_49_2.0.PNG|165px]]

W5 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_2.5.xml SmallWorld_49_2.5.xml]

[[image:kSmallWorld_49_2.5.PNG|150px]]
[[image:kSmallWorldMInit_49_2.5.PNG|165px]]
[[image:kSmallWorldM_49_2.5.PNG|165px]]

W6 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_4.0.xml SmallWorld_49_4.0.xml]

[[image:kSmallWorld_49_4.0.PNG|150px]]
[[image:kSmallWorldMInit_49_4.0.PNG|165px]]
[[image:kSmallWorldM_49_4.0.PNG|165px]]

W7 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_49_8.0.xml SmallWorld_49_8.0.xml]

[[image:kSmallWorld_49_8.0.PNG|150px]]
[[image:kSmallWorldMInit_49_8.0.PNG|165px]]
[[image:kSmallWorldM_49_8.0.PNG|165px]]

W8 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_100_2.0.xml SmallWorld_100_2.0.xml]

[[image:kSmallWorld_100_2.0.PNG|150px]]
[[image:kSmallWorldMInit_100_2.0.PNG|165px]]
[[image:kSmallWorldM_100_2.0.PNG|165px]]

W9 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_100_4.0.xml SmallWorld_100_4.0.xml]

[[image:kSmallWorld_100_4.0.PNG|150px]]
[[image:kSmallWorldMInit_100_4.0.PNG|165px]]
[[image:kSmallWorldM_100_4.0.PNG|165px]]

W10 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_100_8.0.xml SmallWorld_100_8.0.xml]

[[image:kSmallWorld_100_8.0.PNG|150px]]
[[image:kSmallWorldMInit_100_8.0.PNG|165px]]
[[image:kSmallWorldM_100_8.0.PNG|165px]]

W11 [http://insitu.lri.fr/~nhenry/socnets/ksmallworld/kSmallWorld_100_12.0.xml SmallWorld_100_12.0.xml]

[[image:kSmallWorld_100_12.0.PNG|150px]]
[[image:kSmallWorldMInit_100_12.0.PNG|165px]]
[[image:kSmallWorldM_100_12.0.PNG|165px]]

=== Scale-Free Networks Generator ===

BarabasiAlbertGenerator

Parameters: '''init_vertices''' (number of vertices that the graph should start with), '''numEdgesToAttach''' (the number of edges that should be attached from the new vertex to pre-existing vertices at each time step) and '''numSteps''' (number of time steps). init_vertices must be superior or equal to numEdgesToAttach.

{| border="1"
| Parameters and Resulting Graph characteristics
|-
| graphs || W1 ||W2|| W3 || W4 ||W5 ||W6||W7||W8
|- style="background:lightgrey;"
|'''init_vertices'''||4||4||4||4||2||2||2||4
|- style="background:lightgrey;"
|'''numEdgesToAttach'''||2||2||2||1||1||1||2||4
|- style="background:lightgrey;"
|'''numSteps'''||10||50||100|| 100||100||50||50||50
|-
|numVertices||14||53||104|| 80||76||51||52||54
|-
|numEdges||40||200||400||158||150||100||200||400
|-
|components||1||1||1||1||1||1||1||1
|- style="background:#FFFFCC"
|density||0.45||0.27||0.19||0.16||0.16||0.2||0.27||0.37
|-style="background:#FFFFCC"
|clusteringCoefficient||0.15||0.2||0.07||0.51||0.51||0.66||0.16||0.23
|-
|diameter||4||6||6||11||14||8||5||4
|-
|averageShortestDistance||2.24||2.81||3.18||5.26||5.7||3.74||2.8||2.15
|-
|minDegree||2||1||2||1||1||1||2||4
|-
|maxDegree||5||16||19||8||12||16||17||26
|}

W1 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_4_2_10.xml ScaleFree_4_2_10.xml]

[[image:baScaleFree_4_2_10.PNG|150px]]
[[image:baScaleFreeMInit_4_2_10.PNG|165px]]
[[image:baScaleFreeM_4_2_10.PNG|165px]]

W2 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_4_2_50.xml ScaleFree_4_2_50.xml]

[[image:baScaleFree_4_2_50.PNG|150px]]
[[image:baScaleFreeMInit_4_2_50.PNG|165px]]
[[image:baScaleFreeM_4_2_50.PNG|165px]]

W3 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_4_2_100.xml ScaleFree_4_2_100.xml]

[[image:baScaleFree_4_2_100.PNG|150px]]
[[image:baScaleFreeMInit_4_2_100.PNG|165px]]
[[image:baScaleFreeM_4_2_100.PNG|165px]]

W4 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_4_1_100.xml ScaleFree_4_1_100.xml]

[[image:baScaleFree_4_1_100.PNG|150px]]
[[image:baScaleFreeMInit_4_1_100.PNG|165px]]
[[image:baScaleFreeM_4_1_100.PNG|165px]]

W5 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_2_1_100.xml ScaleFree_2_1_100.xml]

[[image:baScaleFree_2_1_100.PNG|150px]]
[[image:baScaleFreeMInit_2_1_100.PNG|165px]]
[[image:baScaleFreeM_2_1_100.PNG|165px]]

W6 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_2_1_50.xml ScaleFree_2_1_50.xml]

[[image:baScaleFree_2_1_50.PNG|150px]]
[[image:baScaleFreeMInit_2_1_50.PNG|165px]]
[[image:baScaleFreeM_2_1_50.PNG|165px]]

W7 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_2_2_50.xml ScaleFree_2_2_50.xml]

[[image:baScaleFree_2_2_50.PNG|150px]]
[[image:baScaleFreeMInit_2_2_50.PNG|165px]]
[[image:baScaleFreeM_2_2_50.PNG|165px]]

W8 [http://insitu.lri.fr/~nhenry/socnets/bascalefree/baScaleFree_4_4_50.xml ScaleFree_4_4_50.xml]

[[image:baScaleFree_4_4_50.PNG|150px]]
[[image:baScaleFreeMInit_4_4_50.PNG|165px]]
[[image:baScaleFreeM_4_4_50.PNG|165px]]

EppsteinPowerLawGenerator

Parameters: '''numVertices''' (the number of vertices for the generated graph), '''numEdges''' (the number of edges the generated graph will have, should be Theta(numVertices)) and '''r''' (the model parameter).

== Real Social Networks ==

Here is a panel of undirected networks issued from scientific articles, benchmarks or contests. Social network visualization or analysis tools provide also some real datasets: Pajek [http://vlado.fmf.uni-lj.si/pub/networks/data/] and UCINet [http://vlado.fmf.uni-lj.si/pub/networks/data/UciNet/UciData.htm].

=== Small-World ===

{| border="1"
| Parameters and Resulting Graph characteristics for Co-Authoring Networks
|Name ||Team Collaboration (with external collaborators)||Infovis component 1 ||Infovis component 2 || Infovis component 3||Infovis component 4
|-style="background:lightgrey"
|'''Source'''||Collected ||Contest||Contest||Contest||Contest
|-
|numNodes||146||135||48||47||32
|-
|numEdges||540||321||91||114||109
|-
|components||1||1||1||1||1
|-style="background:#FFFFCC"
|density||0.16||0.13||0.2||0.23||0.33
|-style="background:#FFFFCC"
|clusteringCoefficient||0.91||0.82||0.79||0.83||0.81
|-
|diameter||4||11||7||10||6
|-
|averageShortestDistance||2.65||4.4||3.71||3.84||2.6
|-
|minDegree||1||1||1||1||1
|-
|maxDegree||57||22||11||15||15
|}

TeamCollaborationExternal [http://insitu.lri.fr/~nhenry/socnets/realsmallworld/teamCollaborationExternalAnonym.xml TeamCollaborationExternal.xml]

[[image: teamCollaborationExternal.PNG|150px]]
[[image: teamCollaborationExternalMInit.PNG|165px]]
[[image: teamCollaborationExternalM.PNG|165px]]

Infovis Component 1 [http://insitu.lri.fr/~nhenry/socnets/realsmallworld/ivComp1.xml ivComp1.xml]

[[image: ivComp1.PNG|150px]]
[[image: ivComp1MInit.PNG|165px]]
[[image: ivComp1M.PNG|165px]]

Infovis Component 2 [http://insitu.lri.fr/~nhenry/socnets/realsmallworld/ivComp2.xml ivComp2.xml]

[[image: ivComp2.PNG|150px]]
[[image: ivComp2MInit.PNG|165px]]
[[image: ivComp2M.PNG|165px]]

Infovis Component 3 [http://insitu.lri.fr/~nhenry/socnets/realsmallworld/ivComp3.xml ivComp3.xml]

[[image: ivComp3.PNG|150px]]
[[image: ivComp3MInit.PNG|165px]]
[[image: ivComp3M.PNG|165px]]

Infovis Component 4 [http://insitu.lri.fr/~nhenry/socnets/realsmallworld/ivComp4.xml ivComp4.xml]

[[image: ivComp4.PNG|150px]]
[[image: ivComp4MInit.PNG|165px]]
[[image: ivComp4M.PNG|165px]]

=== Tree-like ===

{| border="1"
| Parameters and Resulting Graph characteristics for Genealogy and Virus Transmission
|Name ||genealogy||MSTTransmission1||MSTTransmission2||HIVTransmission
|-style="background:lightgrey"
|'''Source'''||Pajek||Article [http://sextrans.bmjjournals.com/cgi/content/abstract/80/4/280]||Article[http://sextrans.bmjjournals.com/cgi/content/abstract/80/4/280]||Article [http://sti.bmjjournals.com/cgi/content/abstract/78/suppl_1/i159]
|-
|numVertices||242||38||84||243
|-
|numEdges||510||78||182||514
|-
|components||1||1||1||1
|-style="background:#FFFFCC"
|density||0.09||0.23||0.16||0.09
|-style="background:#FFFFCC"
|clusteringCoefficient||0.66||0.53||0.52||0.65
|-
|diameter||11||10||9||23
|-
|averageShortestDistance||5.78||4.42||4.31||8.27
|-
|minDegree||1||1||1||1
|-
|maxDegree||14||7||17||20
|}

Gondola Genealogy [http://insitu.lri.fr/~nhenry/socnets/realtreelike/GondolaGen.xml GondolaGen.xml]

[[image: gondolaGen.PNG|150px]]
[[image: gondolaGenMInit.PNG|165px]]
[[image: gondolaGenM.PNG|165px]]

MSTTransmission 1 [http://insitu.lri.fr/~nhenry/socnets/realtreelike/Mst1.xml Mst1.xml]

[[image: mst1.PNG|150px]]
[[image: mst1MInit.PNG|165px]]
[[image: mst1M.PNG|165px]]

MSTTransmission 2 [http://insitu.lri.fr/~nhenry/socnets/realtreelike/Mst2.xml Mst2.xml]

[[image: mst2.PNG|150px]]
[[image: mst2MInit.PNG|165px]]
[[image: mst2M.PNG|165px]]

HIV Transmission [http://insitu.lri.fr/~nhenry/socnets/realtreelike/Hiv.xml Hiv.xml]

[[image: hiv.PNG|150px]]
[[image: hivMInit.PNG|165px]]
[[image: hivM.PNG|165px]]

=== Almost Complete Graphs ===

{| border="1"
| Parameters and Resulting Graph characteristics for Email Communication within a research lab.
|-
|Name||emailDay per person||emailWeek per person||emailMonth per person||emailYear per person||emailDay per team||emailWeek per team||emailMonth per team||emailYear per team
|-style="background:lightgrey"
|'''Source'''||Collected||Collected||Collected||Collected||Collected||Collected||Collected||Collected
|-
|numVertices||134||200||242||447||30||33||35||42
|-
|numEdges||442||1676||3514||11462||183||410||564||980
|-
|components||1||1||1||1||1||1||1||1
|-style="background:#FFFFCC"
|density||0.16||0.2||0.24||0.24||0.45||0.61||0.68||0.75
|-style="background:#FFFFCC"
|clusteringCoefficient||0.52||0.55||0.62||0.71||0.62||0.78||0.83||0.84
|-
|diameter||9||7||6||6||5||3||3||3
|-
|averageShortestDistance||4.29||2.92||2.52||2.42||2.17||1.71||1.57||1.45
|-
|minDegree||1||1||1||1||1||1||1||3
|-
|maxDegree||15||51||86||195||16||26||34||40
|}

Email exchange per person during a day [http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailDay.xml emailDay.xml]

[[image: emailDay.PNG|150px]]
[[image: emailDayMInit.PNG|165px]]
[[image: emailDayM.PNG|165px]]

Email exchange per person during a week [http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailWeek.xml emailWeek.xml]

[[image: emailWeek.PNG|150px]]
[[image: emailWeekMInit.PNG|165px]]
[[image: emailWeekM.PNG|165px]]

Email exchange per person during a month [http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailMonth.xml emailMonth.xml]

[[image: emailMonth.PNG|150px]]
[[image: emailMonthMInit.PNG|165px]]
[[image: emailMonthM.PNG|165px]]

Email exchange per person during a year [http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailYear.xml emailYear.xml]

[[image: emailYear.PNG|150px]]
[[image: emailYearMInit.PNG|165px]]
[[image: emailYearM.PNG|165px]]

Email exchange per research group during a day [http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailGDay.xml emailGDay.xml]

[[image: emailGDay.PNG|150px]]
[[image: emailGDayMInit.PNG|165px]]
[[image: emailGDayM.PNG|165px]]

<blockquote>
Number of email coded with link width in the nodelink, edge color in the matrix
</blockquote>

<blockquote>
[[image: emailGDayS.PNG|150px]]
[[image: emailGDayMC.PNG|165px]]
</blockquote>

Email exchange per research group during a week
[http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailGWeek.xml emailGWeek.xml]

[[image: emailGWeek.PNG|150px]]
[[image: emailGWeekMInit.PNG|165px]]
[[image: emailGWeekM.PNG|165px]]

<blockquote>
Number of email coded with link width in the nodelink, edge color in the matrix
</blockquote>

<blockquote>
[[image: emailGWeekS.PNG|150px]]
[[image: emailGWeekMC.PNG|165px]]
</blockquote>

Email exchange per research group during a month
[http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailGMonth.xml emailGMonth.xml]

[[image: emailGMonth.PNG|150px]]
[[image: emailGMonthMInit.PNG|165px]]
[[image: emailGMonthM.PNG|165px]]

<blockquote>
Number of email coded with link width in the nodelink, edge color in the matrix
</blockquote>

<blockquote>
[[image: emailGMonthS.PNG|150px]]
[[image: emailGMonthMC.PNG|150px]]
</blockquote>

Email exchange per research group during a year
[http://insitu.lri.fr/~nhenry/socnets/realalmostcomplete/emailGYear.xml emailGYear.xml]

[[image: emailGYear.PNG|150px]]
[[image: emailGYearMInit.PNG|165px]]
[[image: emailGYearM.PNG|165px]]

<blockquote>
Number of email coded with link width in the nodelink, edge color in the matrix
</blockquote>

<blockquote>
[[image: emailGYearS.PNG|150px]]
[[image: emailGYearMC.PNG|165px]]
</blockquote>
[[Category:Datasets]]
[[Category:Coffee Room]]
[[Category:Methods]]