ALG2003.bib

@PHDTHESIS{Bohte03,
  AUTHOR = {S.M. Bohte},
  TITLE = {Spiking Neural Networks},
  SCHOOL = {Leiden University},
  SERIES = {{IPA} Dissertation Series 2003-04},
  ISBN = {90-6734-167-3},
  YEAR = 2003
}


@INPROCEEDINGS{WB93,
  AUTHOR = {Lars Willmes and Thomas B{\"a}ck},
  BOOKTITLE = {Second M.I.T.~Conference on Computational Fluid and Solid Mechanics, June 17-20, Cambridge, MA},
  PUBLISHER = {The MIT Press},
  EDITOR = {K.J.~Bathe},
  PAGES = {},
  TITLE = {Evolution Strategies for Engineering Design Optimization},
  YEAR = {2003}
}


@INPROCEEDINGS{WBJS93,
  AUTHOR = {Lars Willmes and Thomas B{\"a}ck and Yaochu Jin and Bernhard Sendhoff},
  BOOKTITLE = {The 2003 Congress on Evolutionary Computation, CEC 2003, 
 December 9-12, Canberra, Australia},
  PUBLISHER = {IEEE Press, Piscataway, NJ},
  EDITOR = {R.~Sarker and R.~Reynolds and H.~Abbass and K.C.~Tan and B.~McKay and D.~Essam, T.~Gedeon},
  PAGES = {663-670},
  TITLE = {Comparing Neural Networks and Kriging for Fitness Approximation in
 Evolutionary Optimization},
  YEAR = {2003}
}


@INPROCEEDINGS{WB93b,
  AUTHOR = {Lars Willmes and Thomas B{\"a}ck},
  BOOKTITLE = {Evolutionary Multi-Criterion Optimization, EMO 2003,
 Second International Conference, April 8-11, Faro, Portugal},
  PUBLISHER = {Springer, Berlin},
  EDITOR = {C.M.~Fonseca and P.J.~Fleming and E.~Zitzler and K.~Deb and L.~Thiele},
  PAGES = {782-795},
  TITLE = {Multi-Criteria Airfoil Design with Evolution Strategies},
  YEAR = {2003}
}


@INPROCEEDINGS{BHZ93,
  AUTHOR = {Thomas B{\"a}ck and Claus Hillermeier and J{\"o}rg Ziegenhirt},
  BOOKTITLE = {Advances in Evolutionary Computing - Theory and 
 Applications},
  PUBLISHER = {Springer, Berlin},
  SERIES = {Natural Computing Series},
  EDITOR = {A.~Ghosh and S.~Tsutsui},
  PAGES = {739-753},
  TITLE = {Routing Optimization in Corporate Networks by Evolutionary 
 Algorithms},
  YEAR = {2003}
}


@ARTICLE{NB93,
  AUTHOR = {Siegfried Nijssen and Thomas B{\"a}ck},
  TITLE = { An analysis of the behaviour of simplified genetic algorithms on trap functions },
  JOURNAL = {IEEE Transactions on Evolutionary Computation},
  VOLUME = {7},
  NUMBER = {1},
  YEAR = {2003},
  PAGES = {11-22}
}


@INPROCEEDINGS{Bae03,
  AUTHOR = {Thomas B{\"a}ck},
  TITLE = {{Prozessoptimierung mit evolution{\"a}ren Algorithmen: 
 Prinzipien und Anwendungsbeispiele}},
  EDITOR = {},
  BOOKTITLE = {{GMA-Kongress 2003 - Automation und Information in 
 Wirtschaft und Gesellschaft, Baden-Baden, Juni 2003}},
  PUBLISHER = {VDI-Verlag, D{\"u}sseldorf},
  YEAR = {2003},
  SERIES = {VDI-Berichte},
  VOLUME = {1756},
  PAGES = {}
}


@INPROCEEDINGS{SBBIK03,
  AUTHOR = {E.V.~Samsonova and T.~B{\"a}ck and A.P.~Ijzerman and 
 J.N.~Kok},
  TITLE = {Combining and comparing cluster methods in a receptor 
 database},
  EDITOR = {},
  BOOKTITLE = {Proceedings of the 5th International Conference on 
 Intelligent Data Analysis (IDA)},
  PUBLISHER = {Springer, Berlin},
  YEAR = {2003},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {2810},
  PAGES = {}
}


@INPROCEEDINGS{nij203,
  AUTHOR = {S. Nijssen and J.N. Kok},
  TITLE = {Efficient Frequent Query Discovery in {FARMER}},
  BOOKTITLE = {Proceedings of the PKDD 2003},
  PUBLISHER = {Springer-Verlag},
  SERIES = {Lecture Notes in Artificial Intelligence},
  VOLUME = {2431},
  YEAR = {2003},
  ABSTRACT = {The upgrade of frequent item set mining to a setup with multiple relations --frequent query mining-- poses many efficiency prob-lems. Taking Object Identity as starting point, we present several optimization techniques for frequent query mining algorithms. The resulting algorithm has a better performance than a previous ILP algorithm and competes with more specialized graph mining algorithms in performance.},
  PAGES = {350--362}
}


@INPROCEEDINGS{nij303,
  AUTHOR = {S. Nijssen and J.N. Kok},
  TITLE = {Proper Refinement of Datalog Clauses using Primary Keys},
  BOOKTITLE = {Proceedings of the 15th Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'03)},
  YEAR = {2003},
  ADDRESS = {Nijmegen, The Netherlands},
  ABSTRACT = {Inductive Logic Programming (ILP) algorithms are frequently used for data mining in multi-relational databases. However, by most ILP algorithms primary key information is disregarded while this information is often available for such databases. This work shows how primary key information can be incorporated in a downward refinement operator. We show how primary keys can be used to define a sublanguage of full clausal logic, and provide evidence that one can define ideal refinement operators for this sublanguage.},
  SIZE = {8 pages}
}


@INPROCEEDINGS{nij403,
  AUTHOR = {S. Nijssen and J.N. Kok},
  TITLE = {Efficient Discovery of Frequent Unordered Trees},
  BOOKTITLE = {Proceedings of the first International Workshop on Mining Graphs, Trees and Sequences (MGTS'03)},
  ABSTRACT = {Recently, an algorithm called {\sc Freqt} was introduced which enumerates all frequent induced subtrees in an {\em ordered} data tree. We propose a new algorithm for mining {\em un}ordered frequent induced subtrees. We show that the complexity of enumerating unordered trees is not higher than the complexity of enumerating ordered trees; a strategy for determining the frequency of unordered trees is introduced.},
  YEAR = {2003}
}


@TECHREPORT{nij404,
  AUTHOR = {S. Nijssen and J.N. Kok},
  TITLE = {Efficient Discovery of Frequent Unordered Trees: Proofs},
  BOOKTITLE = {LIACS Technical Report},
  INSTITUTION = {Leiden Institute of Advanced Computer Science, Universiteit Leiden},
  NUMBER = {1},
  YEAR = {2003}
}


@INPROCEEDINGS{KP,
  AUTHOR = {W.A.~Kosters and W.~Pijls},
  TITLE = {Apriori: {A} Depth First Implementation},
  BOOKTITLE = {Proceedings of FIMI'03, the first Workshop on Frequent Itemset 
               Mining Implementations, Melbourne, Florida, 
	       USA (CEUR Workshop Proceedings)},
  EDITOR = {B. Goethals and M.J. Zaki},
  YEAR = {2003}
}


@INPROCEEDINGS{WK,
  AUTHOR = {M.C. van Wezel and W.A. Kosters},
  TITLE = {Nonmetric Multidimensional Scaling: {N}eural Networks Versus 
           Traditional Techniques},
  BOOKTITLE = {Proceedings of BNAIC 2003, the Fifteenth Belgium-Netherlands Artificial
               Intelligence Conference, Nijmegen, The Netherlands},
  EDITOR = {T. Heskes and P. Lucas and L. Vuurpijl and W. Wiegerinck},
  PAGES = {331-338},
  YEAR = {2003}
}


@INPROCEEDINGS{EKK03,
  AUTHOR = {J. Eggermont and J.N. Kok and W.A. Kosters},
  TITLE = {Genetic Programming for Data Classification: {R}efining the Search Space},
  BOOKTITLE = {Proceedings of the 15th Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'03)},
  YEAR = {2003},
  EDITOR = {T. Heskes and P. Lucas and L. Vuurpijl and W. Wiegerinck},
  PAGES = {123-130},
  ADDRESS = {Nijmegen, The Netherlands},
  MONTH = {23-24 } # OCT,
  ORGANISATION = {BNVKI, Dutch and the Belgian AI Association},
  KEYWORDS = {genetic programming, data classification},
  SIZE = {8 pages}
}


@INPROCEEDINGS{KPP,
  AUTHOR = {W.A.~Kosters and W.~Pijls and V. Popova},
  TITLE = {Complexity Analysis of Depth First and FP-growth Implementations of Apriori},
  BOOKTITLE = {Proceedings of MLDM 2003 (Machine Learning and Data Mining in 
               Pattern Recognition), Leipzig, Germany},
  EDITOR = {P. Perner and A. Rosenfeld},
  PAGES = {284-292},
  PUBLISHER = {Springer},
  SERIES = {LNAI},
  NUMBER = {2734},
  YEAR = {2003}
}


@INPROCEEDINGS{WK2,
  AUTHOR = {M.C. van Wezel and W.A. Kosters},
  TITLE = {Numerical Integration by Cubature Formulae in {B}ayesian Neural Networks},
  BOOKTITLE = {Supplementary Proceedings of ICONIP2003, Istanbul, Turkey},
  PAGES = {82-85},
  YEAR = {2003}
}


@INPROCEEDINGS{MR03,
  AUTHOR = {M. {van der Nat} and G. Rozenberg},
  TITLE = { Gheorghe {P}aun and the {W}indmill {C}uriosity},
  BOOKTITLE = {Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology and Back},
  EDITOR = {C. Martín-Vide and V. Mitrana},
  PAGES = {1-5},
  PUBLISHER = {Taylor and Francis},
  ADDRESS = {London},
  YEAR = {2003}
}


@TECHREPORT{HK01,
  AUTHOR = {H.J. Hoogeboom and W.A. Kosters},
  TITLE = {How to Construct {T}etris Configurations},
  BOOKTITLE = {LIACS Technical Report},
  INSTITUTION = {Leiden Institute of Advanced Computer Science, Universiteit Leiden},
  NUMBER = {8},
  YEAR = {2003}
}


@TECHREPORT{HK02,
  AUTHOR = {R. Breukelaar and H.J. Hoogeboom and W.A. Kosters},
  TITLE = {Tetris is Hard, Made Easy},
  BOOKTITLE = {LIACS Technical Report},
  INSTITUTION = {Leiden Institute of Advanced Computer Science, Universiteit Leiden},
  NUMBER = {9},
  YEAR = {2003}
}


@TECHREPORT{HK03,
  AUTHOR = {H.J. Hoogeboom and W.A. Kosters},
  TITLE = {Tetris and Decidability},
  BOOKTITLE = {LIACS Technical Report},
  INSTITUTION = {Leiden Institute of Advanced Computer Science, Universiteit Leiden},
  NUMBER = {10},
  YEAR = {2003}
}