KDD Proceedings Fact
Jump to navigation
Jump to search
A KDD Proceedings Fact is a fact for a KDD Proceedings.
- Example(s):
- The KDD paper with the fewest publication references is possibly (Anagnostopoulos et al., 2008), with 8[1] publication references.
- The KDD paper with the most publication references is possibly (Yen, Saerens et al., 2008), with 72[2] publication references.
- The KDD paper with the largest citation counts, as of August 2010, is possibly (Joachims, 2002c), with between 500[3] and 1,400[4] paper citations.
- See: ICML Proceedings Fact.
References
- ↑ http://dl.acm.org/citation.cfm?doid=1401890.1401897&preflayout=flat#references
- ↑ http://dl.acm.org/citation.cfm?doid=1401890.1401984&preflayout=flat#references
- ↑ http://dl.acm.org/citation.cfm?id=775067&preflayout=flat#citedby
- ↑ http://scholar.google.com/scholar?q=%22Optimizing+search+engines+using+clickthrough+data%22+2002
2008
- (Anagnostopoulos et al., 2008) ⇒ Aris Anagnostopoulos, Ravi Kumar, and Mohammad Mahdian. (2008). “Influence and Correlation in Social Networks.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008). doi:10.1145/1401890.1401897
- (Yen, Saerens et al., 2008) ⇒ Luh Yen, Marco Saerens, Amin Mantrach, and Masashi Shimbo. (2008). “A Family of Dissimilarity Measures Between Nodes Generalizing Both the Shortest-path and the Commute-time Distances.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008). doi:10.1145/1401890.1401984
2002
- (Joachims, 2002c) ⇒ Thorsten Joachims. (2002). “Optimizing Search Engines Using Clickthrough Data.” In: Proceedings of the eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002) doi:10.1145/775047.775067