Directed Graph Analysis Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "]] ** " to "]]. ** ") |
m (Text replacement - ". " to ". ") |
||
| Line 1: | Line 1: | ||
A [[Directed Graph Analysis Algorithm]] is a [[graph analysis algorithm]] that can be implemented by a [[directed graph analysis system]] to solve a [[directed graph analysis task]]. | A [[Directed Graph Analysis Algorithm]] is a [[graph analysis algorithm]] that can be implemented by a [[directed graph analysis system]] to solve a [[directed graph analysis task]]. | ||
* <B>AKA:</B> [[Link Analysis Method]]. | * <B>AKA:</B> [[Link Analysis Method]]. | ||
* <B>Context</U>:</B> | * <B>Context</U>:</B> | ||
** It can be a [[Domain Dependent Algorithm]], such as a [[Social Network Analysis Algorithm]]. | ** It can be a [[Domain Dependent Algorithm]], such as a [[Social Network Analysis Algorithm]]. | ||
| Line 22: | Line 22: | ||
=== 2009 === | === 2009 === | ||
* http://en.wikipedia.org/wiki/Network_theory | * http://en.wikipedia.org/wiki/Network_theory | ||
** '''Network theory</B> is an area of [[Computer Science|computer science]] and [[Network Science|network science]] and part of [[Graph Theory|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 [[graph (mathematics)|graphs]] as a representation of either [[Symmetric Relation|symmetric relations]] or, more generally, of [[Directed Graph| asymmetric relations]] between discrete objects. Applications of network theory include logistical networks, the [[World Wide Web]], [[gene regulatory network| gene regulatory networks]], metabolic networks, [[social network]]s, [[epistemological]] networks, etc. | ** '''Network theory</B> is an area of [[Computer Science|computer science]] and [[Network Science|network science]] and part of [[Graph Theory|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 [[graph (mathematics)|graphs]] as a representation of either [[Symmetric Relation|symmetric relations]] or, more generally, of [[Directed Graph| asymmetric relations]] between discrete objects. Applications of network theory include logistical networks, the [[World Wide Web]], [[gene regulatory network| gene regulatory networks]], metabolic networks, [[social network]]s, [[epistemological]] networks, etc. | ||
* http://en.wikipedia.org/wiki/List_of_network_theory_topics | * http://en.wikipedia.org/wiki/List_of_network_theory_topics | ||
=== 2001 === | === 2001 === | ||
* ([[2001_StableAlgorithmsForLinkAnalysis|Ng et al., 2001]]) ⇒ [[Andrew Y. Ng]], Alice X. Zheng, and [[Michael I. Jordan]]. ([[2001]]). “Stable Algorithms for Link Analysis.” In: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2001). [http://dx.doi.org/10.1145/383952.384003 doi:10.1145/383952.384003] | * ([[2001_StableAlgorithmsForLinkAnalysis|Ng et al., 2001]]) ⇒ [[Andrew Y. Ng]], Alice X. Zheng, and [[Michael I. Jordan]]. ([[2001]]). “Stable Algorithms for Link Analysis.” In: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2001). [http://dx.doi.org/10.1145/383952.384003 doi:10.1145/383952.384003] | ||
** QUOTE: The [[Kleinberg HITS]] and the [[Google PageRank algorithm]]s are [[eigenvector methods]] for [[identifying]] “[[authoritative]]'' or “[[influential]]'' [[articles]], given [[hyperlink]] or [[citation information]]. | ** QUOTE: The [[Kleinberg HITS]] and the [[Google PageRank algorithm]]s are [[eigenvector methods]] for [[identifying]] “[[authoritative]]'' or “[[influential]]'' [[articles]], given [[hyperlink]] or [[citation information]]. | ||
---- | ---- | ||
Revision as of 18:52, 1 August 2022
A Directed Graph Analysis Algorithm is a graph analysis algorithm that can be implemented by a directed graph analysis system to solve a directed graph analysis task.
- AKA: Link Analysis Method.
- Context:
- It can be a Domain Dependent Algorithm, such as a Social Network Analysis Algorithm.
- …
- Example(s):
- Counter-Example(s):
- See: Link Analysis System.
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.
- http://en.wikipedia.org/wiki/List_of_network_theory_topics
2001
- (Ng et al., 2001) ⇒ Andrew Y. Ng, Alice X. Zheng, and Michael I. Jordan. (2001). “Stable Algorithms for Link Analysis.” In: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2001). doi:10.1145/383952.384003
- QUOTE: The Kleinberg HITS and the Google PageRank algorithms are eigenvector methods for identifying “authoritative or “influential articles, given hyperlink or citation information.