메뉴 건너뛰기




Volumn 7207 LNAI, Issue , 2012, Pages 286-301

Learning theories using estimation distribution algorithms and (reduced) bottom clauses

Author keywords

Estimation Distribution Algorithm; Inductive Logic Programming; Reduce Algorithm

Indexed keywords

DISTRIBUTION ALGORITHMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; IN-PHASE; INVERSE ENTAILMENT; LEARNING THEORY; REAL-WORLD DATASETS; SEARCH SPACES; STOCHASTIC SEARCH;

EID: 84864839459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31951-8_25     Document Type: Conference Paper
Times cited : (6)

References (29)
  • 3
    • 84958959530 scopus 로고    scopus 로고
    • From recombination of genes to the estimation of distributions i. Binary parameters
    • In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) Springer, Heidelberg
    • Mühlenbein, H., Paaß, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178-187. Springer, Heidelberg (1996)
    • (1996) PPSN 1996. LNCS , vol.1141 , pp. 178-187
    • Mühlenbein, H.1    Paaß, G.2
  • 5
    • 0003984832 scopus 로고
    • Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
    • Technical Report: CMU-CS-94-163
    • Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Carnegie Mellon University, Pittsburgh (1994); Technical Report: CMU-CS-94-163
    • (1994) Carnegie Mellon University Pittsburgh
    • Baluja, S.1
  • 8
    • 84864858072 scopus 로고    scopus 로고
    • The Aleph Manual, last access September 29, 2011
    • Srinivasan, A.: The Aleph Manual, http://www.comlab.ox.ac.uk/activities/ machinelearning/Aleph/(last access September 29, 2011)
    • Srinivasan, A.1
  • 10
    • 37849037799 scopus 로고    scopus 로고
    • Qg/ga: A stochastic search approach for progol
    • doi:10.1007/s10994-007-5029-3
    • Muggleton, S., Tamaddoni-Nezhad, A.: QG/GA: A stochastic search approach for Progol. Machine Learning 70(2-3), 123-133 (2007), doi:10.1007/s10994-007- 5029-3
    • (2007) Machine Learning , vol.70 , Issue.2-3 , pp. 123-133
    • Muggleton, S.1    Tamaddoni-Nezhad, A.2
  • 12
    • 40249091414 scopus 로고    scopus 로고
    • Using bayesian networks to direct stochastic search in inductive logic programming
    • In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) Springer, Heidelberg
    • Oliphant, L., Shavlik, J.: Using Bayesian Networks to Direct Stochastic Search in Inductive Logic Programming. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 191-199. Springer, Heidelberg (2008)
    • (2008) ILP 2007. LNCS (LNAI) , vol.4894 , pp. 191-199
    • Oliphant, L.1    Shavlik, J.2
  • 13
    • 84957891317 scopus 로고    scopus 로고
    • Carcinogenesis predictions using ilp
    • In: Dẑeroski, S., Lavrac, N. (eds.) Springer, Heidelberg
    • Srinivasan, A., King, R.D.S.H., Muggleton, S., Sternberg, M.: Carcinogenesis Predictions using ILP. In: Dẑeroski, S., Lavrac, N. (eds.) ILP 1997. LNCS (LNAI), vol. 1297, pp. 273-287. Springer, Heidelberg (1997)
    • (1997) ILP 1997. LNCS (LNAI) , vol.1297 , pp. 273-287
    • Srinivasan, A.1    King, R.D.S.H.2    Muggleton, S.3    Sternberg, M.4
  • 14
    • 0000183134 scopus 로고
    • Relating chemical activity to structure: An examination of ilp successes
    • King, R.D., Srinivasan, A., Sternberg, M.J.E.: Relating chemical activity to structure: an examination of ILP successes. New Gen. Comp. 13, 411-433 (1995)
    • (1995) New Gen. Comp. , vol.13 , pp. 411-433
    • King, R.D.1    Srinivasan, A.2    Sternberg, M.J.E.3
  • 15
    • 0042847140 scopus 로고    scopus 로고
    • Inference for the generalization error
    • Nadeau, C., Bengio, Y.: Inference for the Generalization Error. Machine Learning 52(3), 239-281 (2003)
    • (2003) Machine Learning , vol.52 , Issue.3 , pp. 239-281
    • Nadeau, C.1    Bengio, Y.2
  • 17
    • 58549087411 scopus 로고    scopus 로고
    • Toplog: Ilp using a logic program declarative bias
    • In: Garcia de la Banda, M., Pontelli, E. (eds.) Springer, Heidelberg
    • Muggleton, S.H., Santos, J.C.A., Tamaddoni-Nezhad, A.: TopLog: ILP Using a Logic Program Declarative Bias. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 687-692. Springer, Heidelberg (2008)
    • (2008) ICLP 2008. LNCS , vol.5366 , pp. 687-692
    • Muggleton, S.H.1    Santos, J.C.A.2    Tamaddoni-Nezhad, A.3
  • 18
    • 84937415213 scopus 로고    scopus 로고
    • Refining complete hypotheses in ilp
    • In: Dẑeroski, S., Flach, P.A. (eds.) Springer, Heidelberg
    • Bratko, I.: Refining Complete Hypotheses in ILP. In: Dẑeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 44-55. Springer, Heidelberg (1999)
    • (1999) ILP 1999. LNCS (LNAI) , vol.1634 , pp. 44-55
    • Bratko, I.1
  • 19
    • 40249096014 scopus 로고    scopus 로고
    • Revising first-order logic theories from examples through stochastic local search
    • In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) Springer, Heidelberg
    • Paes, A., Zaverucha, G., Santos Costa, V.: Revising First-Order Logic Theories from Examples Through Stochastic Local Search. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol. 4894, pp. 200-210. Springer, Heidelberg (2008)
    • (2008) ILP 2007. LNCS (LNAI) , vol.4894 , pp. 200-210
    • Paes, A.1    Zaverucha, G.2    Santos Costa, V.3
  • 21
    • 38049098082 scopus 로고    scopus 로고
    • Ilp through propositionalization and stochastic k-term dnf learning
    • In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) Springer, Heidelberg
    • Paes, A., Ẑelezný, F., Zaverucha, G., Page, D.L., Srinivasan, A.: ILP Through Propositionalization and Stochastic k-Term DNF Learning. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol. 4455, pp. 379-393. Springer, Heidelberg (2007)
    • (2007) ILP 2006. LNCS (LNAI) , vol.4455 , pp. 379-393
    • Paes, A.1    Ẑelezný, F.2    Zaverucha, G.3    Page, D.L.4    Srinivasan, A.5
  • 22
    • 84954427488 scopus 로고    scopus 로고
    • Searching the subsumption lattice by a genetic algorithm
    • In: Cussens, J., Frisch, A.M. (eds.) Springer, Heidelberg
    • Tamaddoni-Nezhad, A., Muggleton, S.H.: Searching the Subsumption Lattice by a Genetic Algorithm. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol. 1866, pp. 243-252. Springer, Heidelberg (2000)
    • (2000) ILP 2000. LNCS (LNAI) , vol.1866 , pp. 243-252
    • Tamaddoni-Nezhad, A.1    Muggleton, S.H.2
  • 23
    • 41749115020 scopus 로고    scopus 로고
    • Hierarchical bayesian optimization algorithm toward a new generation of evolutionary algorithms, 1st edn
    • Springer
    • Pelikan, M.: Hierarchical Bayesian Optimization Algorithm Toward a New Generation of Evolutionary Algorithms, 1st edn. STUDFUZZ, vol. 170. Springer (2005)
    • (2005) STUDFUZZ , vol.170
    • Pelikan, M.1
  • 24
    • 7044231000 scopus 로고    scopus 로고
    • Lattice-search runtime distributions may be heavy-tailed
    • In: Matwin, S., Sammut, C. (eds.) Springer, Heidelberg
    • Ẑelezný, F., Srinivasan, A., Page, D.: Lattice-Search Runtime Distributions May Be Heavy-Tailed. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 333-345. Springer, Heidelberg (2003)
    • (2003) ILP 2002. LNCS (LNAI) , vol.2583 , pp. 333-345
    • Ẑelezný, F.1    Srinivasan, A.2    Page, D.3
  • 25
    • 33748260363 scopus 로고    scopus 로고
    • Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
    • Goadrich, M., Oliphant, L., Shavlik, J.: Gleaner: Creating Ensembles of First-Order Clauses to Improve Recall-Precision Curves. Machine Learning 64(1-3), 231-261 (2006)
    • (2006) Machine Learning , vol.64 , Issue.1-3 , pp. 231-261
    • Goadrich, M.1    Oliphant, L.2    Shavlik, J.3
  • 27
    • 37849006230 scopus 로고    scopus 로고
    • On the connection between the phase transition of the covering test and the learning success rate in ilp
    • Alphonse, E., Osmani, A.: On the connection between the phase transition of the covering test and the learning success rate in ILP. Machine Learning Journal 70(2-3), 135-150 (2008)
    • (2008) Machine Learning Journal , vol.70 , Issue.2-3 , pp. 135-150
    • Alphonse, E.1    Osmani, A.2
  • 28
    • 0001247275 scopus 로고
    • Propagating uncertainty in bayesian networks by probabilistic logic sampling
    • In: Lemmer, J.F., Kanal, L.N. (eds.) North Holland
    • Henrion, M.: Propagating Uncertainty in Bayesian Networks by Probabilistic Logic Sampling. In: Lemmer, J.F., Kanal, L.N. (eds.) Uncertainty in Artificial Intelligence, vol. 2, pp. 149-163. North Holland (1988)
    • (1988) Uncertainty in Artificial Intelligence , vol.2 , pp. 149-163
    • Henrion, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.