Directed Graph Analysis Task
(Redirected from Network Analysis Task)
Jump to navigation
Jump to search
A Directed Graph Analysis Task is an graph analysis task whose input is a directed graph dataset.
- Context:
- It can range from being a Directed Graph Edge Analysis to being a Directed Graph Node Analysis.
- …
- Example(s):
- Counter-Example(s):
- See: Time Series Analysis, Itemset Mining Task.
References
2009
- http://en.wikipedia.org/wiki/Network_theory
- Network theory is an area of computer science and network science and part of graph theory. It has application in many disciplines including particle physics, computer science, biology, economics, operations research, and sociology. Network theory concerns itself with the study of graphs as a representation of either symmetric relations or, more generally, of asymmetric relations between discrete objects. Applications of network theory include logistical networks, the World Wide Web, gene regulatory networks, metabolic networks, social networks, epistemological networks, etc.
2007
- (Leskovec et al., 2007) ⇒ Jure Leskovec, A. Krause, C. Guestrin, Christos Faloutsos, J. VanBriesen, N.S. Glance. (2007). “Cost-effective outbreak detection in networks.” In: Proceedings of KDD-2007.
2006
- (Clauset et al., 2006) ⇒ Aaron Clauset, Cristopher Moore, and M. E. J. Newman. (2006). “Structural inference of hierarchies in networks.” In: Proceedings of 23rd International Conference on Machine Learning (ICML), Lecture Notes in Computer Science, Springer, Berlin.
- (Newman & Leicht, 2006) ⇒ Mark E. J. Newman, and Elizabeth A. Leicht. (2006). “Mixture Models and Exploratory Data Analysis in Networks.” In: Proceedings of the Natl. Acad. Sci. USA
2003
- (Kempe et al., 2003) ⇒ D. Kempe, Jon M. Kleinberg, and Éva Tardos, (2003). “Maximizing the Spread of Influence Through a Social Network.” In: Proceedings of KDD-2003.