IEEE 7th International Conference on Research Challenges in Information Science (RCIS) 2013
DOI: 10.1109/rcis.2013.6577695
|View full text |Cite
|
Sign up to set email alerts
|

Monitoring user-system interactions through graph-based intrinsic dynamics analysis

Abstract: Abstract-Monitoring the evolution of user-system interactions is of high importance for complex systems and for information systems in particular, especially to raise alerts automatically when abnormal behaviors occur. However current methods fail at capturing the intrinsic dynamics of the system, and focus on evolution due to exogenous factors like day-night patterns. In order to capture the intrinsic dynamics of user-system interactions, we propose an innovative graph-based approach relying on a novel concep… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…Modularity measures the strength of the division of a network into clusters and evaluates the divisions the algorithm generated (Newman & Girvan, 2004). Then, we applied the Louvain optimization modularity algorithm (i.e., a tool to calculate modularity properties embedded in Gephi) to detect automatically the nonoverlapping and optimized partitions with the highest modularity score, grouping each word node into a specific cluster and marking with colors (Heymann & Le Grand, 2013). The prominence of a cluster is determined by the number of nodes it contains; thus, the larger the number of nodes in a cluster, the more prominent the cluster.…”
Section: Methods and Datamentioning
confidence: 99%
“…Modularity measures the strength of the division of a network into clusters and evaluates the divisions the algorithm generated (Newman & Girvan, 2004). Then, we applied the Louvain optimization modularity algorithm (i.e., a tool to calculate modularity properties embedded in Gephi) to detect automatically the nonoverlapping and optimized partitions with the highest modularity score, grouping each word node into a specific cluster and marking with colors (Heymann & Le Grand, 2013). The prominence of a cluster is determined by the number of nodes it contains; thus, the larger the number of nodes in a cluster, the more prominent the cluster.…”
Section: Methods and Datamentioning
confidence: 99%
“…Whereas extrinsic time is broadly used without notice, previous works have shown that the choice between extrinsic and intrinsic time has a very significant impact both on the measurement of statistical properties of temporal networks and on observation of diffusion processes [32], [33]. Previous results on social networks suggest that intrinsic time is better at characterizing the endogenous dynamics of the network, because extrinsic time is more likely to capture exogenous patterns like day-night activity of users.…”
Section: Different Notions Of Timementioning
confidence: 99%
“…Whereas the extrinsic time is broadly used without notice, we have found out in [10] that these two different concepts of time have a high impact on the measurement of statistical properties of temporal networks. Our previous results seem to suggest that intrinsic time is better at characterizing the endogenous dynamics of the network, because extrinsic time is more likely to capture exogenous patterns like day-night activity of users in information networks.…”
Section: A Intrinsic Versus Extrinsic Timementioning
confidence: 99%
“…In this paper, we propose a simple yet innovative approach to study the impact of graph dynamics on diffusion. This methodology does not require any new computation once the diffusion process has been measured; instead of observing the diffusion phenomenon as a function of usual time -e.g., measured in seconds-which we call here extrinsic time, we propose to observe it as a function of what we call intrinsic time [10]. Indeed, this time is intrinsically related to graph dynamics as an intrinsic time slot is not absolute: it corresponds to the appearance of new links in the network, as explained in the following of the paper.…”
Section: Introduction and Contextmentioning
confidence: 99%