Narratives in the network: Interactive methods for mining cell signaling networks

Journal of Computational Biology

Volumn 19, Issue 9, 2012, Pages 1043-1059

  Hossain, M Shahriar ^a   Akbar, Monika ^a   Polys, Nicholas F ^a  

^a Virginia Polytechnic Institute and State University   (United States)

Author keywords

cellular signaling pathway; clustering; Frequent Subgraph Discovery; storytelling; Subgraph Extension Generation.

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; COMPUTER GRAPHICS; DATA MINING; FACTUAL DATABASE; HUMAN; METHODOLOGY; SIGNAL TRANSDUCTION;

ALGORITHMS; ANIMALS; COMPUTER GRAPHICS; DATA MINING; DATABASES, FACTUAL; HUMANS; SIGNAL TRANSDUCTION;

EID: 84866270964     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2011.0244     Document Type: Article

References (28)

1. Abello, J., van Ham, F., and Krishnan, N. 2006. ASK-GraphView: a large scale graph visualization system. IEEE Trans. Vis. Comput. Graph. 12, 669-676. (Pubitemid 44955590)
2. Agrawal, R., Mehta, M., Shafer, J., et al. 1996. The Quest data mining system. The Second International Conference on Knowledge Discovery and Data Mining. 244-249.
3. Agrawal, R., and Srikant, R. 1994. Fast algorithms for mining association rules in large databases. The 20th International Conference on Very Large Data Bases. Morgan Kaufmann Publishers, Inc. 487-499.
4. Beygelzimer, A., Kakade, S., and Langford, J. 2006. Cover trees for nearest neighbor. The 23rd International Conference on Machine Learning. 97-104.
5. Brassard, J.-P., and Gecsei, J. 1980. Path building in cellular partitioning networks. The 7th Annual Symposium on Computer Architecture. 44-50.
6. Breslin, T., Krogh, M., Peterson, C., et al. 2005. Signal transduction pathway p0rofiling of individual tumor samples. BMC Bioinformatics. 6, 163.
7. Carpenter, B. 2004. Phrasal queries with LingPipe and Lucene: ad hoc genomics text retrieval. Presented at the 13th Text Retrieval Conference (TREC 2004), Gaithersburg, MD.
8. Cohen, M., and Gudes, E. 2004. Diagonally subgraphs pattern mining. The 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. 51-58.
9. Das-Neves, F., Fox, E.A., and Yu, X. 2005. Connecting topics in document collections with stepping stones and pathways. The 14th ACM International Conference on Information and Knowledge Management. 91-98. (Pubitemid 44022117)
10. Database of Cell Signaling. 2011. In: Science Signaling, The Signal Transduction Knowledge Environment. Available at: http://stke.sciencemag.org/cm/
11. Faloutsos, C., McCurley, K.S., and Tomkins, A. 2004. Fast discovery of connection subgraphs. The 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 118-127. (Pubitemid 40114922)
12. Hossain, M.S.,Gresock, J., Edmonds, Y., et al. 2012. Connecting the dots between PubMed abstracts. PLoS ONE. 7, e29509.
13. Ketkar, N.S., Holder, L.B., and Cook, D.J. 2005. Subdue: Compression-based frequent pattern discovery in graph data. The First International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations. 71-76.
14. Kim, J.-D., Ohta, T., Tateisi, Y., et al. 2003. GENIA corpus-a semantically annotated corpus for bio-textmining. Bioinformatics. 19, 180-182.
15. Kumar, D., Ramakrishnan, N., Helm, R.F., et al. 2008. Algorithms for storytelling. IEEE Trans. Knowl. Data Eng. 20, 736-751. (Pubitemid 351606069)
16. Lin, F.-R., and Hsueh, C.-M. 2006. Knowledge map creation and maintenance for virtual communities of practice. Inf. Process. Manage. 42, 551-568.
17. Macqueen, J.B. 1967. Some methods of classification and analysis of multivariate observations. The Fifth Berkeley Symposium on Mathematical Statistics and Probability. 281-297.
18. Michihiro, K., and George, K. 2004. An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng. 16, 1038-1051.
19. Miyake, S., Tohsato, Y., Takenaka, Y., et al. 2003. A clustering method for comparative analysis between genomes and pathways. The Eighth International Conference on Database Systems for Advanced Applications. 327.
20. Ratprasartporn, N., Cakmak, A., and Ozsoyoglu, G. 2006. On data and visualization models for signaling pathways. The 18th International Conference on Scientific and Statistical Database Management. 133-142.
21. Schreiber, F. 2003. Comparison of metabolic pathways using constraint graph drawing. The First Asia-Pacific Bioinformatics Conference on Bioinformatics. 19, 105-110.
22. Shahaf, D., and Guestrin, C. 2010. Connecting the dots between news articles. The 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 623-632.
23. Swanson, D.R. 1991. Complementary structures in disjoint science literatures. The 14th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 280-289.
24. Tan, P.N., Steinbach, M., and Kumar, V. 2006. Introduction to data mining. Addison-Wesley, Boston.
25. Xian, X., and Yanbin, Y. 2007. Modeling and verifying WNT signaling pathway. Third International Conference on Natural Computation. 2, 319-323.
26. Yan, X., and Han, J. 2002. gSpan: Graph-based Substructure pattern mining. International Conference on Data Mining. 721.
27. Zaki, M.J., and Ramakrishnan, N. 2005. Reasoning about sets using Redescription Mining. The Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. 364-373. (Pubitemid 43218298)
28. Zhang, T., Ramakrishnan, R., and Livny, M. 1996. BIRCH: an efficient data clustering method for very large databases. The 1996 ACM SIGMOD International Conference on Management of Data. 103-114. (Pubitemid 126440760)