Internet Relay Chat - Revision history

UE-InfoVis08-10 at 07:46, 7 May 2008

2008-05-07T07:46:46Z

← Older revision		Revision as of 07:46, 7 May 2008
Line 100:		Line 100:

	Disadvantages:		Disadvantages:
	*~~application~~ written in pure Java so that it could be altered		*Application written in pure Java so that it could be altered
	*Complexity of some driagrams containing edges when the network is very big		*Complexity of some driagrams containing edges when the network is very big

UE-InfoVis08-10 at 07:43, 7 May 2008

2008-05-07T07:43:19Z

← Older revision		Revision as of 07:43, 7 May 2008
Line 44:		Line 44:
	A simple social network is modelling by a graph with nodes and edges linked together, which represent respectively users and users relationship.		A simple social network is modelling by a graph with nodes and edges linked together, which represent respectively users and users relationship.

	[[Image:~~Simple_Social_Network~~.jpg\|center\|~~Simple_Social_Network~~.jpg]]		[[Image:Simple_Social_Network_annotation.jpg\|center\|280px\|Simple_Social_Network_annotation.jpg]]

UE-InfoVis08-10 at 23:08, 6 May 2008

2008-05-06T23:08:52Z

← Older revision		Revision as of 23:08, 6 May 2008
Line 39:		Line 39:
	This figure represents the interface of a typical IRC client (with annotations):		This figure represents the interface of a typical IRC client (with annotations):

	[[Image:GUI_IRC_annotation.jpg\|center\|GUI_IRC_annotation.jpg]]		[[Image:GUI_IRC_annotation.jpg\|center\|450px\|GUI_IRC_annotation.jpg]]


Line 54:		Line 54:
	In this figure it is clear that some newcomers like "lars_g" for example stole the central place from "The_Vulture".		In this figure it is clear that some newcomers like "lars_g" for example stole the central place from "The_Vulture".

	[[Image:Channel_Java_lars.jpg\|center\|Channel_Java_lars.jpg]]		[[Image:Channel_Java_lars.jpg\|center\|450px\|Channel_Java_lars.jpg]]


	Two disconnected social networks are represented in the following figure. The smallest network is constituted by three users who are communicating exclusively each other. The other one, apparently not interested in the three other users, is well-balanced and thanks to the m-limited alteration don't produce a too large diagram.		Two disconnected social networks are represented in the following figure. The smallest network is constituted by three users who are communicating exclusively each other. The other one, apparently not interested in the three other users, is well-balanced and thanks to the m-limited alteration don't produce a too large diagram.

	[[Image:Channel_disconnected.jpg\|center\|Channel_disconnected.jpg]]		[[Image:Channel_disconnected.jpg\|center\|450px\|Channel_disconnected.jpg]]


Line 65:		Line 65:


	[[Image:Channel_disconnected_noedges.jpg\|center\|Channel_disconnected_noedges.jpg]]		[[Image:Channel_disconnected_noedges.jpg\|center\|450px\|Channel_disconnected_noedges.jpg]]


Line 85:		Line 85:


			{{FloatingQuote\|The bot can produce drawings and animations of these social network diagrams on demand.\| [Paul Mutton, 2004]}}
	== Suitable Datatypes ==		== Suitable Datatypes ==
	The appropriated datatypes are some diagrams or designed graphics.		The appropriated datatypes are some diagrams or designed graphics which can be used to create an animation.


	== Evaluation ==		== Evaluation ==
Line 93:		Line 95:
	*Defining some settings, the configuration of this bot in some very busy channels could be used by participants like a personal spam filter.		*Defining some settings, the configuration of this bot in some very busy channels could be used by participants like a personal spam filter.
	*Establishing links between people on the personal homepage of each user		*Establishing links between people on the personal homepage of each user
			*Using of inferred social networksfor "Char Circles"
			*Showing to users the channels having the same interests than his interests


	Disadvantages:		Disadvantages:
	*application written in pure Java so that it could be altered		*application written in pure Java so that it could be altered
			*Complexity of some driagrams containing edges when the network is very big

	== References ==		== References ==

UE-InfoVis08-10 at 22:50, 6 May 2008

2008-05-06T22:50:18Z

← Older revision		Revision as of 22:50, 6 May 2008
Line 38:		Line 38:

	This figure represents the interface of a typical IRC client (with annotations):		This figure represents the interface of a typical IRC client (with annotations):

			[[Image:GUI_IRC_annotation.jpg\|center\|GUI_IRC_annotation.jpg]]


	A simple social network is modelling by a graph with nodes and edges linked together, which represent respectively users and users relationship.		A simple social network is modelling by a graph with nodes and edges linked together, which represent respectively users and users relationship.

			[[Image:Simple_Social_Network.jpg\|center\|Simple_Social_Network.jpg]]


	After a short time in the channel #java, we can notice than one of the user "The_Vulture" is like an essential piece of the puzzle: it means that he is in the center of the diagram and of the network as a result. He is linked closely and directly or not to some people, he impacts on the network configuration as well.		After a short time in the channel #java, we can notice than one of the user "The_Vulture" is like an essential piece of the puzzle: it means that he is in the center of the diagram and of the network as a result. He is linked closely and directly or not to some people, he impacts on the network configuration as well.

			[[Image:Channel_Java_TheVulture.jpg\|center\|Channel_Java_TheVulture.jpg]]


	In this figure it is clear that some newcomers like "lars_g" for example stole the central place from "The_Vulture".		In this figure it is clear that some newcomers like "lars_g" for example stole the central place from "The_Vulture".

			[[Image:Channel_Java_lars.jpg\|center\|Channel_Java_lars.jpg]]


	Two disconnected social networks are represented in the following figure. The smallest network is constituted by three users who are communicating exclusively each other. The other one, apparently not interested in the three other users, is well-balanced and thanks to the m-limited alteration don't produce a too large diagram.		Two disconnected social networks are represented in the following figure. The smallest network is constituted by three users who are communicating exclusively each other. The other one, apparently not interested in the three other users, is well-balanced and thanks to the m-limited alteration don't produce a too large diagram.

			[[Image:Channel_disconnected.jpg\|center\|Channel_disconnected.jpg]]


	In case of a too big number of participants, it is not absolutely necessary to draw the edges between the node. It is indeed easy to evaluate the importance of relationships by judging the proximity of these nodes as it is shown in this figure.		In case of a too big number of participants, it is not absolutely necessary to draw the edges between the node. It is indeed easy to evaluate the importance of relationships by judging the proximity of these nodes as it is shown in this figure.


			[[Image:Channel_disconnected_noedges.jpg\|center\|Channel_disconnected_noedges.jpg]]


	== Important Citations ==		== Important Citations ==

UE-InfoVis08-10 at 16:58, 6 May 2008

2008-05-06T16:58:56Z

← Older revision		Revision as of 16:58, 6 May 2008
Line 71:		Line 71:

	== Suitable Datatypes ==		== Suitable Datatypes ==
			The appropriated datatypes are some diagrams or designed graphics.

	== Evaluation ==		== Evaluation ==

	Advantages:		Advantages:
	*Integrating this application in an existing IRC client may allow users to filter irrelevant messages.		*Integrating this application in an existing IRC client may allow users to filter irrelevant messages.
	*Defining some settings, the configuration of this bot in some very busy channels could be used by participants like a personal spam filter.		*Defining some settings, the configuration of this bot in some very busy channels could be used by participants like a personal spam filter.
	*Establishing links between people on the personal homepage of each user		*Establishing links between people on the personal homepage of each user





	Disadvantages:		Disadvantages:

UE-InfoVis08-10 at 16:54, 6 May 2008

2008-05-06T16:54:12Z

← Older revision		Revision as of 16:54, 6 May 2008
Line 76:		Line 76:

	Advantages:		Advantages:
	- Integrating this application in an existing IRC client may allow users to filter irrelevant messages.		*Integrating this application in an existing IRC client may allow users to filter irrelevant messages.
	- Defining some settings, the configuration of this bot in some very busy channels could be used by participants like a personal spam filter.		*Defining some settings, the configuration of this bot in some very busy channels could be used by participants like a personal spam filter.
	- Establishing links between people on the personal homepage of each user		*Establishing links between people on the personal homepage of each user


Line 85:		Line 85:

	Disadvantages:		Disadvantages:
	- application written in pure Java so that it could be altered		*application written in pure Java so that it could be altered

	== References ==		== References ==

84.114.238.101 at 16:19, 6 May 2008

2008-05-06T16:19:12Z

@@ Line 37: / Line 37: @@
 == Figures ==
 == Important Citations ==
@@ Line 60: / Line 75: @@
 == Evaluation ==
 == References ==

84.114.238.101 at 16:12, 6 May 2008

2008-05-06T16:12:12Z

← Older revision		Revision as of 16:12, 6 May 2008
Line 14:		Line 14:
	* The first step of the method is the "'''Social Network Analysis'''". It consists in measuring the relationships and flows between users and entities. These results come from an IRC robot. It permits to monitor a channel and to carry out a heuristic analysis of events.		* The first step of the method is the "'''Social Network Analysis'''". It consists in measuring the relationships and flows between users and entities. These results come from an IRC robot. It permits to monitor a channel and to carry out a heuristic analysis of events.

	* The second step is the "'''Visualization of the Social network'''". In fact, a representation of this mathematical analysis allows to determine and see easily ~~differents~~ facts of the Social Network. So in order to visualize the social network, there are several stages to do:		* The second step is the "'''Visualization of the Social network'''". In fact, a representation of this mathematical analysis allows to determine and see easily different facts of the Social Network. So in order to visualize the social network, there are several stages to do:

	:*The first one is called "'''Inferring the Social Network'''". We have to infer the approximate mathematical representation to obtain a social network derived from the heuristics. There is a lot of methods to infer relationships in the graph: <br/>		:*The first one is called "'''Inferring the Social Network'''". We have to infer the approximate mathematical representation to obtain a social network derived from the heuristics. There is a lot of methods to infer relationships in the graph: <br/>
Line 30:		Line 30:
	Once the visualization was improved, '''it reveals the structure of the social network and highlights connectivity, clustering and strengths of relationships between users'''. We also only have to interpret the graph.		Once the visualization was improved, '''it reveals the structure of the social network and highlights connectivity, clustering and strengths of relationships between users'''. We also only have to interpret the graph.

	Each time that the robot is ~~invocated~~, it draws a diagram. If the IRC bot stores several sequences, an animation of the evolution of the social network can be obtained after having pieced these together. However it is possible as well to draw a new state of the network from the last stored nodes.		Each time that the robot is appealed, it draws a diagram. If the IRC bot stores several sequences, an animation of the evolution of the social network can be obtained after having pieced these together. However it is possible as well to draw a new state of the network from the last stored nodes.

	With the same way than in the real life, the bot reduces the weightings of the edges during a relationship is deteriorating because of an prolonged inactivity between the concerned people. Indeed if someone doesn't have anymore activity, he will disappear of the diagram after a while.		With the same way than in the real life, the bot reduces the weightings of the edges during a relationship is deteriorating because of an prolonged inactivity between the concerned people. Indeed if someone doesn't have anymore activity, he will disappear of the diagram after a while.

UE-InfoVis08-10 at 14:10, 6 May 2008

2008-05-06T14:10:38Z

← Older revision		Revision as of 14:10, 6 May 2008
Line 5:		Line 5:

	== Short description ==		== Short description ==

			'''Internet Relay Chat (IRC) is a system, which is used by two or more persons in order to collaborate and chat in real-time from anywhere in the world.''' <br/>
			IRC users can not only send messages directly between each other, but also join a set of channels (formed by users with a common interest) and send messages that all users in the channel can see.


			The aim of this paper is to describe a method of inferring the social network of several IRC users in a channel and producing visualizations of the resulting data.

			* The first step of the method is the "'''Social Network Analysis'''". It consists in measuring the relationships and flows between users and entities. These results come from an IRC robot. It permits to monitor a channel and to carry out a heuristic analysis of events.

			* The second step is the "'''Visualization of the Social network'''". In fact, a representation of this mathematical analysis allows to determine and see easily differents facts of the Social Network. So in order to visualize the social network, there are several stages to do:

			:*The first one is called "'''Inferring the Social Network'''". We have to infer the approximate mathematical representation to obtain a social network derived from the heuristics. There is a lot of methods to infer relationships in the graph: <br/>

			::*Monitoring occurrences of direct addressing (specification of the user nickname) <br/>
			::*Temporal Proximity (determination of question/response and so the link between two users by analysing the time between the messages) <br/>
			::*Temporal Density (determination of a conversation between two users by examining the messages frequency and their author) <br/>
			::*Monitoring Private Messages: not a valid method (Ethical problem and problem of user presence in many channels) <br/>

			:*The second stage is "'''Examining the Inferred Social Network'''", that is to say to calculate results and draw conclusions with the help of the graph theoretic structure. Then, it's very practical to deduce conclusions like: the most active user, disconnected social networks...

			:*The third stage is "'''Creation of the Visualization'''" (Drawing Social Networks). It represents which relationships are present and their strength. According to the obtained results, we can make modifications to have the most legible graph : either by using a two or three-Dimensions Visualization or by choosing between the several graph drawing method:The spring embedder or the Modified Spring Embedder Force Model or by limiting the distance of the disconnected networks having used the m-limited Force Model...


			Once the visualization was improved, '''it reveals the structure of the social network and highlights connectivity, clustering and strengths of relationships between users'''. We also only have to interpret the graph.

			Each time that the robot is invocated, it draws a diagram. If the IRC bot stores several sequences, an animation of the evolution of the social network can be obtained after having pieced these together. However it is possible as well to draw a new state of the network from the last stored nodes.

			With the same way than in the real life, the bot reduces the weightings of the edges during a relationship is deteriorating because of an prolonged inactivity between the concerned people. Indeed if someone doesn't have anymore activity, he will disappear of the diagram after a while.

UE-InfoVis08-10 at 13:52, 6 May 2008

2008-05-06T13:52:06Z

← Older revision		Revision as of 13:52, 6 May 2008
Line 1:		Line 1:
	== Author ==		== Author ==

	*[[Mutton%2C_Paul\|Paul Mutton]] ~~<br/>~~		*[[Mutton%2C_Paul\|Paul Mutton]]


Line 34:		Line 34:

	== References ==		== References ==
			[Mutton P.] [http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1320122 Inferring and visualizing social networks on Internet relay chat.] In: ''Information Visualization, 2004. IV 2004. Eigth International Conference on Information Visualisation'', pages 35-43, Canterbury, United Kingdom, 14-16 July 2004.<br/>

	== Evaluation Reference ==		== Evaluation Reference ==
			[Mutton P.] [http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1320122 Inferring and visualizing social networks on Internet relay chat.] In: ''Information Visualization, 2004. IV 2004. Eigth International Conference on Information Visualisation'', pages 35-43, Canterbury, United Kingdom, 14-16 July 2004.


	[[Category:Techniques]]		[[Category:Techniques]]