簡易檢索 / 詳目顯示

研究生: 游清圳
Ching-Chung Yu
論文名稱: 網路主題模型:以關聯資料為基礎的特徵萃取法
Network Motif Model: An Efficient Approach to Extract Features from Relational Data
指導教授: 李漢銘
Hahn-Ming Lee
口試委員: 許清琦
Ching-Chi Hsu
何建明
Jan-Ming Ho
何正信
Cheng-Seen Ho
李育杰
Yuh-Jye Lee
學位類別: 碩士
Master
系所名稱: 電資學院 - 資訊工程系
Department of Computer Science and Information Engineering
論文出版年: 2005
畢業學年度: 93
語文別: 英文
論文頁數: 71
中文關鍵詞: 網路主題關聯資料統計關聯學習
外文關鍵詞: Network motifs, Relational data, Statistical relational learning
相關次數: 點閱:224下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 統計關聯學習是一種新興的機械學習研究。它是一種將統計學習結合關聯表示的方法,用來解決關聯資料的預測問題。統計關聯學習主要的研究方向為關聯表示語言及結合關聯表示語言用來萃取特徵,再將這些特徵運用到機械學習的方法。在統計關聯學習的研究中,大部分的研究是使用歸納邏輯級程式設計及或然關聯模型來萃取特徵。但由於歸納邏輯級程式設計的特徵只提供單一資訊,而或然關聯模型只使用分佈機率,因此遺漏彼此的資訊以至於在分類時降低了預測的準確率。為此,我們提議將這兩種資訊整合在一起作為預測學習的知識表示法,用來改善預測的準確度。為此,我們提議網路主題模型的理論來萃取關聯資料的特徵。因為我們是用網路主題(network motifs)來萃取關聯資料的交互連結圖形,因此我們稱這種方法為網路主題模型。而藉由網路主題模型可以確實從關聯資料中萃取出有意義的特徵。我們將這些特徵運用到分類問題。而實驗的結果顯示出這些特徵是非常有意義的,且確實的改善了分類的準確度。這結果顯示網路主題模型是一個好的特徵萃取模型。


    Statistical relational learning is an emerging research area in machine learning that combines statistical learning with relational representations to predict properties of relational data. Some learning models are frequently used to solve feature extraction of relational data in statistical relational learning research area. These models include first-order Bayesian classifier (1BC2) [Fla04], probabilistic relational models (PRMs) [Get03c], and relational Markov networks (RMNs) [Fri04]. They are based on inductive logic programming and Bayesian network [Dze01][Nev03a].
    Inductive logic programming (ILP) [Nug94] is deterministic classification approaches, which uses inductive methods to extract features. Nevertheless, inductive logic programming does not model probability distribution; therefore, due to the particular predicate adopted by these approaches [Dze01]. Because of this, Lise Getoor et al. [Get03c] proposed a probability relational model (PRMs), which uses probability distribution to predict the properties of objects.
    Probability relational models integrate probability models and relational logic. It is found that using these two approaches (ILP and PRMs) to extract features cannot achieve high performance, especially extracting features from multi-relational data. This is because ILP uses first-order logic to represent data, but it extracts single property features only [Fla04]; thus, we cannot obtain multiple label features using ILP. PRMs use probability distribution to predict properties of objects, but the feature is described by a value of probability distribution; thus, PRMs cannot integrate first-order information into the feature. Therefore, in statistical relational learning, current feature extraction approaches cannot achieve high accuracy in predicting properties of objects
    Using PRMS to extract features, the first step is to discover sub-graphs. Then, the probability distributions of the sub-graphs will be calculated. Please notice that the probability distribution of this sub-graph is a feature. Hence, after computation, many probabilities distributions of sub-graphs will generate many features. Next, these features will be applied to Bayesian network to predict the properties of objects.
    It is found that these sub-graphs can be multiple label features, yet the significances of sub-graphs are not clear enough. On the other hand, network motifs can identify significant sub-graphs from network structure in complex networks. Compared with sub-graphs identified by PRMs, using network motifs to predict sub-graphs can identify far more sub-graphs than PRMs. If the sub-graphs of network motifs can be combined with first-order information, the significancy of sub-graphs will be clearer.
    We assume that using sub-graphs as multiple label features might describe the properties of objects clearer; the accuracy in predicting properties of objects might be improved. Therefore, this thesis will focus on extracting multiple label features by network motifs to improve the accuracy in predicting properties of objects in order to prove our assumption is correct. Experiment results clearly show that network motif model is a good feature extraction in statistical relational learning.

    Chinese Abstract . . . . . . . . . . . . . . . . . . . . . I English Abstract . . . . . . . . . . . . . . . . . . . . . II Acknowledgements . . . . . . . . . . . . . . . . . . . . . IV Contents . . . . . . . . . . . . . . . . . . . . . . . . . VI List of Tables . . . . . . . . . . . . . . . . . . . . . . VIII List of Figures . . . . . . . . . . .. . . . . . . . . . . . IX 1 Introduction . . . . . . . . . . . . . . . . . . . . 1 1.1 Motivations . . . . . . . . . . . . . . . . . . . . 1 1.2 Goal and Design . . . . . . . . . . . . . . . . . . 2 1.3 Organization of Thesis . . . . . . . . . . . . . . . 3 2 Background . . . . . . . . . . . . . . . . . . . . . 4 2.1 Statistical Relational Learning . . . . . . . . . . 4 2.2 Knowledge Background . . . . . . . . . . . . . . . . 8 2.2.1 Representing Relational Data . . . . . . . . . . . . 8 2.2.2 Network Motifs . . . . . . . . . . . . . . . . . . . 10 3 Network Motif Model . . . . . . . . . . . . . . . . 13 3.1 Overview of Our Approach . . . . . . . . . . . . . . 15 3.2 System Architecture . . . . . . . . . . . . . . . . 15 3.2.1 Network Constructing . . . . . . . . . . . . . . . . 17 3.2.2 Network Motif Extracting . . . . . . . . . . . . . . 19 3.2.3 Sub-graphs labeling . . . . . . . . . . . . . . . . 25 3.3 Discussion . . . . . . . . . . . . . . . . . . . . . 27 4 Experimental Evaluation . . . . . . . . . . . . . . 32 4.1 Experimental Design . . . . . . . . . . . . . . . . 32 4.1.1 Experimental Tools . . . . . . . . . . . . . . . . . 32 4.1.2 Experimental Datasets . . . . . . . . . . . . . . . 33 4.2 Experimental Evaluation of General Data . . . . . . 34 4.2.1 Mutagenesis . . . . . . . . . . . . . . . . . . . . 34 4.2.2 Alzheimer’s Disease . . . . . . . . . . . . . . . . 35 4.3 Experimental Evaluation of Large Scale Dataset . . . 36 4.4 Discussion . . . . . . . . . . . . . . . . . . . . . 38 5 Conclusions and Future Work . . . . . . . . . . . . 42 5.1 Conclusions . . . . . . . . . . . . . . . . . . . . 42 5.2 Future Work . . . . . . . . . . . . . . . . . . . . 43 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . 44

    [Alb04] Istvan Albert and Reka Albert, "Conserved network motifs allow protein–protein interaction prediction", Bioinformatics, Vol. 20, No. 18, pp. 3346-3352, 2004.
    [Alo05] Shalev Itzkovitz, Uri Alon, "Subgraphs and network motifs in geometric networks", Physical Review E: statistical, nonlinear and soft-matter physics, Vol. 71, pp. (026117) 1-9, 2005.
    [Adi04] Jafar Adibi, Hans Chalupsky, Marko Grobelnik, Dunja Mladenic and Natasa Milic-Frayling, "KDD-2004 workshop report link analysis and group detection (LinkKDD-2004)", ACM SIGKDD Explorations, Vol. 6 , No. 2, pp. 136-139, 2004.
    [And03] Christophe Andrieu, Nando de Freitas, Arnaud Doucet, and Michael I. Jordan, "An introduction to MCMC for machine learning", Machine Learning, Vol. 50, No. 1-2, pp. 5-43, 2003.
    [Ban04] Wolfgang Banzhaf and P. Dwight Kuo, "Network motifs in natural and artificial transcriptional regulatory networks", Journal of Biological Physics and Chemistry, Vol. 4, No. 2, pp. 85-92, 2004.
    [Ber04] Johannes Berg and Michael Lassig ,"Local graph alignment and motif search in biological networks", Proprietary Rights Notice for the Proceedings of the National Academy of Sciences, , Vol. 101, No. 41, pp. 14689-14694, 2004.
    [Blo04] Hendrik Blockeel and Werner Uwents, "Using neural networks for relational learning", In Proceedings of the twenty-first International Conference on Machine Learning (ICML2004), Workshop on Statistical Relational Learning and its Connections to Other Fields (SRL2004), 2004.
    [Bos99] Henrik Bostrom and Lars Asker, "Combining divide-and-conquer and separate-and-conquer for efficient and effective rule induction", Lecture Notes In Computer Science, Vol. 1634, pp. 33-43, In Proceedings of the ninth International Workshop on Inductive Logic Programming, 1999.
    [Buc64] J. Richard Buchi, "Transfinite automata recursions and weak second order theory of ordinals", In Proceedings International Congress Logic, Methodology, and Philosophy of Science, pp. 2-23, North-Holland Publ. Co., 1964.
    [Bur01] Robert Burbidge, Matthew Trotter, Bernard F. Buxton and Sean B. Holden, "Drug design by machine learning: support vector machines for pharmaceutical data analysis", Computers and Chemistry, Vol. 26, No. 1, pp. 5-14, 2001.
    [Cal00] Andrew Kachites McCallum, Kamal Nigam, Jason Rennie and Kristie Seymore, "Automating the construction of Internet portals with machine learning", Information Retrieval, Vol. 3, No. 2, pp. 127-163, 2000.
    [Cha01] Chih-Chung Chang and Chih-Jen Lin, "LIBSVM: alibraryfor support vector machines", http://www.csie.ntu.edu.tw/~cjlin/libsvm, 2001.
    [Che02] Jie Cheng, Christos Hatzis, Hisashi Hayashi, Mark-A. Krogel, Shinichi Morishita, David Page, and Jun Sese, "KDD Cup 2001 report", SIGKDD Explorations, Vol. 3, No. 2, pp. 47-64, 2002.
    [Chi04] David Maxwell Chickering, David Heckerman and Christopher Meek, "Large-sample learning of Bayesian networks is NP-hard", Journal of Machine Learning Research, Vol. 5 , pp. 1287-1330, 2004.
    [Coo03] Colin Cooper and Alan Frieze, "A general model of Web graphs", Random Structures & Algorithms, Vol. 22, No. 3, pp. 311-335, 2003.
    [Cra98] Mark Craven, Dan DiPasquo, Dayne Freitag, Andrew McCallum, Tom Mitchell, Kamal Nigam and Sean Slattery, "Learning to extract symbolic knowledge from the World Wide Web", In Proceedings of the fifteenth National/tenth Conference on Artificial Intelligence/Innovative Applications of Artificial Intelligence, pp. 509-516, 1998.
    [Cul05] Aron Culotta and Andrew McCallum, "Joint deduplication of multiple record types in relational data", In Proceedings of the fourteenth Conference on Information and Knowledge Management (CIKM2005), 2005.
    [Cum03] Chad Cumby and Dan Roth, "Feature extraction languages for propositionalized relational learning", In Proceedings of eighteenth International Joint Conference on Artificial Intelligence (IJCAI2003), Workshop on Learning Statistical Models from Relational Data (SRL2003), 2003.
    [Dan01] Evgeny Dantsin, Thomas Eiter, Georg Gottlob and Andrei Voronkov, "Complexity and expressive power of logic programming", ACM Computing Surveys, Vol. 33 , No. 3, pp. 374-425, 2001.
    [Die04] Dietterich, Lise Getoor and Kevin Murphy, editors, In Proceedings of the twenty-first International Conference on Machine Learning (ICML2004), Workshop on Statistical Relational Learning and its Connections to Other Fields (SRL2004), AAAI Press, 2004.
    [Dhi03] Inderjit S. Dhillon, Subramanyam Mallela and Rahul Kumar, "A divisive information theoretic feature clustering algorithm for text classification", Journal of Machine Learning Research, Vol. 3, special issue on special feature, pp. 1265-1287, 2003.
    [Dob04] Radu Dobrin, Qasim K Beg, Albert-Laszlo Barabasi and Zoltan N Oltvai, "Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network", BMC Bioinformatics, Vol. 5, pp. 1-8, 2004.
    [Dun98] Duncan J. Watts and Steven H. Strogatz, “Collective dynamics of small-world networks”, Nature, Vol. 393, No. 6684, pp. 440-442, 1998.
    [Dze98] Saso Dzeroski, Steffen Schulze-Kremer, Karsten R. Heidtke, Karsten Siems, Dietrich Wettschereck and Hendrik Blockeel, "Diterpene structure elucidation from 13C NMR spectra with inductive logic programming", Applied Artificial Intelligence, Vol. 12, No. 5, pp. 363-383, special issue on First-Order Knowledge Discovery in Databases, 1998.
    [Dze01] Saso Dzeroski and Nada Lavrac, editors, "Relational data mining", Springer-Verlag, 2001.
    [Dze03a] Saso Dzeroski, Luc De Raedt and Stefan Wrobel, "Multirelational data mining 2003: workshop report", SIGKDD Explorations, Vol. 5, No. 2, pp. 200-202, 2003.
    [Dze03b] Saso Dzeroski, "Multi-relational data mining: an introduction", SIGKDD Explorations, Vol. 5, No. 1, pp. 1-16, 2003,
    [Dze04] Saso Dzeroski and Hendrik Blockeel, "Multi-relational data mining 2004: workshop report", SIGKDD Explorations, Vol. 6, No. 2, pp. 140-141, 2004.
    [Ebe03] Holger Ebel, Jorn Davidsen and Stefan Bornholdt, "Dynamics of social networks", Complexity, Vol. 8, No. 2, pp. 24-27, 2003.
    [Eit00] Thomas Eiter, Georg Gottlob and Yuri Gurevich, "Existential second-order logic over strings", Journal of the ACM, Vol. 47, No. 1, pp. 77-131, 2000.
    [Fla04] Peter A. Flach and Nicolas Lachiche, "Naive Bayesian classification of structured data", Machine Learning, Vol 57, No. 3, pp. 233-269, 2004.
    [Fri03] Nir Friedman and Daphne Koller, "Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks", Machine Learning, Vol. 50, No. 1-2, pp. 95-125, 2003.
    [Fun04] Glenn M. Fung and O. L. Mangasarian, "A feature selection Newton method for support vector machine classification", Computational Optimization and Applications, Vol. 28, No. 2, pp. 185-202, 2004.
    [Gar03a] Diego Garlaschelli, Guido Caldarelli and Luciano Pietronero, "Universal scaling relations in food webs", Nature, Vol. 423, No. 6936, pp. 165-168, 2003.
    [Gar04] Thomas Gartner, John W. Lloyd and Peter A. Flach, "Kernels and distances for structured data", Machine Learning, Vol. 57, No. 3, pp. 205-232, 2004.
    [Get00] Lise Getoor and David Jensen, editors, In Proceedings of the AAAI-2000 Workshop on Learning Statistical Models from Relational Data, AAAI Press, 2000.
    [Get03a] Lise Getoor and David Jensen, editors, In Proceedings of eighteenth International Joint Conference on Artificial Intelligence (IJCAI2003), Workshop on Learning Statistical Models from Relational Data (SRL2003), AAAI Press, Aug. 2003.
    [Get03b] Lise Getoor, "Link mining: a new data mining challenge", SIGKDD Explorations, Vol. 5, No. 1, pp. 84-89, 2003.
    [Get03c] Lise Getoor, Nir Friedman, Daphne Koller and Benjamin Taskar, "Learning probabilistic models of link structure", Journal of Machine Learning Research, Vol. 3, No. 4-5, special issue on the Eighteenth International Conference on Machine Learning (ICML2001), pp. 679-708, 2003.
    [Gil98] C. Lee Giles, Kurt D. Bollacker and Steve Lawrence, "CiteSeer: an automatic citation indexing system", In Proceedings of the third ACM Conference on Digital libraries, pp. 89-98, 1998.
    [Got04] Georg Gottlob, Phokion G. Kolaitis and Thomas Schwentick, "Existential second-order logic over graphs: Charting the tractability frontier", Journal of the ACM, Vol. 51, No. 2, pp. 312-362, 2004.
    [Gui05] Roger Guimera, and Luis A. Nunes Amaral, "Functional cartography of complex metabolic networks", Nature, Vol. 433, No. 7028, pp. 895-900, 2005.
    [Guy03] Isabelle Guyon and Andre Elisseeff, "An Introduction to Variable and Feature Selection", Journal of Machine Learning Research, Vol. 3 , special issue on Variable and Feature Selection, pp. 1157-1182, 2003.
    [Hew02] Rattikorn Hewett and John Leuchner, "Knowledge discovery with second-order relations", Knowledge and Information Systems, Vol. 4, No. 4, pp. 413-439, 2002.
    [Her04] Jonathan L. Herlocker, Joseph A. Konstan, Loren G. Terveen and John T. Riedl, "Evaluating collaborative filtering recommender systems", ACM Transactions on Information Systems, Vol. 22 , No. 1, pp. 5-53, 2004.
    [Hir04] Kouichi Hirata, Takeshi Ogawa and Masateru Harao, "Generalization algorithms for second-order terms", Lecture Notes in Computer Science, Jul. 2004, Vol. 3194, pp. 147-163, In Proceedings of the fourteenth International Conference on Inductive Logic Programming (ILP2004), , 2004.
    [Hua05] Sui Huang, Gabriel Eichler, Yaneer Bar-Yam, and Donald E. Ingber, "Cell Fates as High-dimensional attractor states of a complex gene regulatory network", Physical Review Letters, Vol. 94, No. 128701, 94 (2005): 128701, 2005.
    [Itz05] Shalev Itzkovitz, Reuven Levitt, Nadav Kashtan, Ron Milo, Michael Itzkovitz and Uri Alon, "Coarse-graining and self-dissimilarity of complex networks", Physical Review E: statistical, nonlinear and soft-matter physics, Vol. 71, pp. (016127) 1-10, 2005.
    [Kal05] Shiraz Kalir, Shmoolik Mangan and Uri Alon, "A coherent feed-forward loop with a SUM input function prolongs flagella expression in Escherichia coli", Molecular Systems Biology, doi: 10.1038 / msb4100010, 2005.
    [Kas04] Nadav Kashtan, Shalev Itzkovitz, Ron Milo and Uri Alon, "Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs", Bioinformatics, Vol. 20, No. 11, pp. 1746-1758, 2004.
    [Kim05] Hyunsoo Kim, Peg Howland and Haesun Park, "Dimension reduction in text classification with support vector machines", Journal of Machine Learning Research, Vol. 6, pp. 37-53, 2005.
    [Kin92] Ross D. King, Stephen Muggleton, Richard A. Lewis and Michael J.E. Sternberg, "Drug design by machine learning: The use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase", Proceedings of the National Academy of Sciences, Vol. 89, No. 23, pp. 11322-11326, 1992.
    [Kok05] Stanley Kok and Pedro Domingos, "Learning the structure of Markov logic networks", In Proceedings of the twenty second International Conference on Machine Learning (ICML2005), 2005.
    [Koi04] Mikko Koivisto, Kismat Sood, "Exact Bayesian Structure Discovery in Bayesian Networks", Journal of Machine Learning Research, Vol. 5, pp. 549-573, 2004.
    [Kon03] Michio Kondoh, "Foraging adaptation and the relationship between food-web complexity and stability", Science, Vol. 229, No. 5611, pp. 1388-1391, 2003.
    [Kro04] Mark-A. Krogel and Tobias Scheffer, "Multi-relational learning, text mining, and semi-supervised learning for functional genomics", Machine Learning, Vol. 57, No. 1-2, pp. 61–81, 2004.
    [Jae00] Manfred Jaeger, "On the complexity of inference about probabilistic relational models", Artificial Intelligence", Vol. 117 , No. 2, pp. 297-308, 2000.
    [Joa02] Thorsten Joachims, "Learning to classify text using support vector machines : Methods, Theory and Algorithms", Springer, 2002.
    [Lat03] Carl A. Latkin, Forman V., Knowlton A. and Sherman S., "Norms, social networks, and HIV-related risk behaviors among urban disadvantaged drug users”, Social Seience & Medicine, Vol. 56, No. 3, pp. 465-476, 2003.
    [Lav94] Nada Lavrac and Saso Dzeroski, "Inductive logic programming: Techniques and applications", Prentice Hall, 1994.
    [Lev05] T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava and G. Yorsh, "Simulating reachability using first-order logic with Applications to verification of linked data structures", In Proceedings of the twentieth International Conference on Automated Deduction, 2005.
    [Lia05] Lin Liao, Dieter Fox and Henry Kautz, "Location-based activity recognition using relational Markov networks", In Proceedings of the nineteenth International Joint Conference on Artificial Intelligence (IJCAI2005), 2005.
    [Lis04] Francesca A. Lisic and Donato Malerba, "Inducing multi-level association rules from multiple relations", Machine Learning, Vol.55, No. 2, pp. 175-210, 2004.
    [Lil03] Fredrik Liljeros, Christofer R. Edling and Luis A. Nunes Amaral, "Sexual networks: implications for the transmission of sexually transmitted infections", Microbes and Infection, Vol.5, No. 2, pp. 189-196, 2003.
    [Liu98] Huan Liu and Hiroshi Motoda, "Feature extraction, construction and selection: A data mining perspective", Kluwer Academic, 1998.
    [Llo03] John W. Lloyd, "Logic for learning", Springer, 2003.
    [Lod02] Huma Lodhi and Yike Guo, "Gram-schmidt kernels applied to structure activity analysis for drug design", In Proceedings of eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Workshop on Data Mining in Bioinformatics (BIOKDD2002), pp. 37-42, 2002.
    [Man03a] Shmoolik Mangan, Alon Zaslaver and Uri Alon, "The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks", Journal of Molecular Biology, Vol. 334, No. 2, pp. 179-347, 2003.
    [Man03b] Shmoolik Mangan and Uri Alon, "Structure and function of the feed-forward loop network motif", Proprietary Rights Notice for the proceedings of the National Academy of Sciences (PNAS), Vol. 100, No. 21, pp. 11908-11985, 2003.
    [Mug94] Stephen Muggleton and Luc De Raedt, "Inductive logic programming: theory and methods". Journal of Logic Programming, Vol. 19/20, Sup. 1, pp. 629-679, 1994.
    [Mug98] Stephen Muggleton, Ashwin Srinivasan, Ross D. King and Michael J. E. Sternberg, "Biochemical knowledge discovery using inductive logic programming", Lecture Notes In Computer Science, Vol. 1532, pp. 326-341, In Proceedings of the first International Conference on Discovery Science, 1998.
    [Maz05] Aurelien Mazurie, Samuel Bottani and Massimo Vergassola, "An evolutionary and functional assessment of regulatory network motifs", Genome Biology, Vol. 6, No. 4, R35, 2005.
    [Mcg03] Amy McGovern and David Jensen, "Identifying predictive structures in relational data using multiple instance learning", In Proceedings of the twentieth International Conference on Machine Learning (ICML’03), 2003
    [Mil02] Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii and Uri Alon, "Network motifs: Simple building blocks of complex networks", Science, Vol. 298, No. 5594, pp. 824-827, Oct. 2002.
    [Mil04] Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer and Uri Alon, "Superfamilies of evolved and designed networks", Science, Vol. 303, No. 5663, pp. 1538-1542. 2004.
    [Moo04] Raymond J. Mooney, Prem Melville, Lappoon Rupert Tang, Jude Shavlik, Ines de Castro Dutra and David Page, "Relational data mining with inductive logic programming for link discovery", In Proceedings of the National Science Foundation Workshop on Next Generation Data Mining (NGDM2002), A updated version of this paper appears in "Data mining: next generation challenges and future directions", Editer by Hillol Kargupta, Anupam Joshi, Krishnamoorthy Sivakumar, Yelena Yesha, Publisher: AAAI/MIT Press, 2004.
    [Nev03a] Jennifer Neville, Matthew Rattigan and David Jensen, "Statistical relational learning: Four claims and a survey", In Proceedings of eighteenth International Joint Conference on Artificial Intelligence (IJCAI2003), Workshop on Learning Statistical Models from Relational Data (SRL2003), 2003.
    [Nev03b] Jennifer Neville, David Jensen and Brian Gallagher, "Simple estimators for relational Bayesian classifiers", In Proceedings of third IEEE International Conference on Data Mining, pp. 609-615, 2003.
    [Nev03c] Jennifer Neville, David Jensen, Lisa Friedland and Michael Hay, "Learning relational probability trees", In Proceedings of the ninth ACM SIGKDD International Conference on Knowledge discovery and Data Mining, pp. 625-630, 2003.
    [Ngo97] Liem Ngo and Peter Haddawy, "Answering queries from context-sensitive probabilistic knowledge bases", In Proceedings of the International Workshop on Uncertainty in Databases and Deductive Systems, pp. 147-177, 1997.
    [Ott05] S. Ott, A. Hansen, S.-Y. Kim and S. Miyano, "Superiority of network motifs over optimal networks and an application to the revelation of gene network evolution", Bioinformatics, Vol. 21, No. 12, pp. 227-238, 2005.
    [Odo04] Duncan T. Odom, Nora Zizlsperger, D. Benjamin Gordon, George W. Bell, Nicola J. Rinaldi, Heather L. Murray, Tom L. Volkert, Jorg Schreiber, P. Alexander Rolfe, David K. Gifford, Ernest Fraenkel, Graeme I. Bell and Richard A. Young, "Control of Pancreas and Liver gene expression by HNF transcription factors", Science, Vol. 303, No. 5662, pp. 1378-1381, 2004.
    [Pap93] Christos H. Papadimitriou, "Computational complexity", Addison Wesley, 1993.
    [Pop03a] Alexandrin Popescul and Lyle H. Ungar, "Structural logistic regression for link analysis", In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Workshop on Multi-Relational Data Mining (MRDM2003), 2003.
    [Pop03b] Alexandrin Popescul and Lyle H. Ungar, "Statistical relational learning for link prediction", In Proceedings of eighteenth International Joint Conference on Artificial Intelligence (IJCAI2003), Workshop on Learning Statistical Models from Relational Data (SRL2003), 2003.
    [Ric05a] Matthew Richardson and Pedro Dominggos, "Markov logic networks", Machine Learning, special issue: Multi-relational Data Mining and Statistical Relational Learning. To appear.
    [Ric05b] Jeremy Rice, Aaron Kershenbaum and Gustavo Stolovitzky, "Lasting impressions: Motifs in protein–protein maps may provide footprints of evolutionary events", Proprietary Rights Notice for the Proceedings of the National Academy of Sciences (PNAS), Vo. 102, No. 9, pp. 3173-3174, 2005.
    [Sal00] Andrea Saltelli, K. Chan, E. M. Scott, editors, "Sensitivity Analysis", John Wiley & Sons, 2000.
    [Sim04] Ingve Simonsen, Kasper Astrup Eriksen, Sergei Maslov and Kim Sneppen, "Diffusion on complex networks : A way to probe their large scale topological structures", Physical A: Statistical Mechanics and its Applications, Vol. 336, No. 1-2, pp. 163-173, 2004.
    [Spo04] Olaf Sporns and Rolf Kotter, "Motifs in Brain networks", PLoS Biology, Vol. 2, No. 11, e369, pp. 1910-1918, 2004.
    [Sto05] D. B. Stouffer,a J. Camacho, R. Guimera, C. A. Ng and L. A. Nunes Amarala, "Quantitative patterns in the structure of model and empirical food webs", Ecology, Vol. 86, No. 5, pp. 1301-1311, 2005.
    [Sun04] Zehang Sun, George Bebis and Ronald Miller, "Object detection using feature subset selection", Pattern Recognition, Vol. 37, No.11, pp. 2165-2176, 2004.
    [Vit05] Vittoria Colizza, Alessandro Flammini, Amos Maritan and Alessandro Vespignani, "Characterization and modeling of protein–protein interaction networks", Physical A: Statistical Mechanics and its Applications, Special issue: Physics Applied to Biological Systems, Vol. 352, No. 1, pp. 1-27, 2005.
    [War03] Manfred K. Warmuth, Jun Liao, Gunnar Ratsch, Michael Mathieson, Santosh Putta and Christian Lemmen, "Active learning with support vector machines in the drug discovery process", Journal of Chemical Information and Computer Sciences, Vol. 43, No. 2, pp. 667-673, 2003.
    [Was94] Stanley Wasserman, Katherine Faust, Dawn Iacobucci and Mark Granovetter, "Social network analysis: methods and applications", Currently unavailable, 1994.
    [Wan02] Xiao Fan Wang, "Complex networks: topology, dynamics and synchronization", International Journal of Bifurcation and Chaos, Vol. 12, No. 5, pp. 885-916, 2002.
    [Wuc03] S Wuchty, Z N Oltvai and A-L Barabasi, "Evolutionary conservation of motif constituents in the yeast protein interaction network", Genetics, Vol. 35, No. 2, pp. 176-179, 2003.
    [Yeg04] Esti Yeger-Lotem, Shmuel Sattath, Nadav Kashtan, Shalev Itzkovitz, Ron Milo, Ron Y. Pinter, Uri Alon and Hanah Margalit, "Network motifs in integrated cellular networks of transcription–regulation and protein–protein interaction", Proprietary Rights Notice for the Proceedings of the National Academy of Sciences (PNAS), Vol. 101, No. 16, pp. 5934-5939, 2004.
    [Zha05] Lan V Zhang, Oliver D King, Sharyl L Wong, Debra S Goldberg, Amy HY Tong, Guillaume Lesage, Brenda Andrews, Howard Bussey, Charles Boone and Frederick P Roth, "Motifs, themes and thematic maps of an integrated Saccharomyces cerevisiae interaction network", Journal of Biology, Vol. 4, No. 2, 4:6, 2005.
    [Zhu05] Dongxiao Zhu and Zhaohui S Qin, "Structural comparison of metabolic networks in selected single cell organisms", BMC Bioinformatics, Vol. 6, pp. 1-12, 2005.

    無法下載圖示 全文公開日期 本全文未授權公開 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館:臺灣博碩士論文系統)
    QR CODE