Refining causality: Who copied from whom?

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 466-474

  Snowsill, Tristan ^a   Fyson, Nick ^a   De Bie, Tijl ^a   Cristianini, Nello ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Network inference; Reconstruction; Suffix tree; Text reuse

Indexed keywords

ACTIVE AREA; CAUSAL NETWORK; NETWORK INFERENCE; OBSERVED DATA; RECONSTRUCTION; REUSE; SUB-STRINGS; SUFFIX-TREES; TEXT REUSE; UNDERLYING NETWORKS;

FORESTRY;

EID: 80052663702     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020483     Document Type: Conference Paper

References (17)

1. Spinn3r API. http://www.spinn3r.com/2008.
2. Supporting website, https://patterns.enm.bris.ac.uk/projects/ refiningcausality, 2011.
3. E. Adar and L. Adamic. Tracking information epidemics in blogspace. In Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence, pages 207-214. Citeseer, 2005. (Pubitemid 44419052)
4. B. Bollobáas, C. Borgs, J. Chayes, and O. Riordan. Directed scale-free graphs. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pages 132-139. Society for Industrial and Applied Mathematics, 2003.
5. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of operations research, 4(3):233-235, 1979.
6. P. Erdos and A. Rényi. On the evolution of random graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pages 17-61. 1960.
7. I. Flaounas, M. Turchi, T. De Bie, and N. Cristianini. Inference and validation of networks. In Machine Learning and Knowledge Discovery in Databases, volume 5781 of Lecture Notes in Computer Science, pages 344-358. Springer Berlin/Heidelberg, 2009.
8. N. Fyson, T. De Bie, and N. Cristianini. Reconstruction of Causal Networks by Set Covering. In ICANNGA'11: International Conference on Adaptive and Natural Computing Algorithms, Ljubljana, Slovenia, 2011.
9. M. Gomez-Rodriguez, J. Leskovec, and A. Krause. Inferring Networks of Diffusion and Influence. In KDD2010: The 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2010.
10. D. Gusfield. Algorithms on strings, trees and sequences. Cambridge University Press, 1997.
11. J. Leskovec, L. Backstrom, and J. Kleinberg. Meme-tracking and the Dynamics of the News Cycle. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 497-506. ACM New York, NY, USA, 2009.
12. E. M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, Apr. 1976.
13. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM Journal on Computing, 17(6):1253-1262, 1988.
14. P. Slavík. Improved performance of the greedy algorithm for partial cover. Information Processing Letters, 64(5):251-254, Dec. 1997. (Pubitemid 127382748)
15. T. Snowsill and F. Nicart. A hard-disk based suffix tree implementation. Technical Report 133088, University of Bristol, Bristol, UK, 2011.
16. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
17. P. Weiner. Linear pattern matching algorithms. In IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory, 1973. SWAT'08, pages 1-11, 1973.