[Picture]

Walter Kosters

Curriculum Vitae

I am an associate professor in computer science at LIACS, the Computer Science department of Universiteit Leiden. Current research interests include: neural networks, genetic algorithms, analysis of algorithms, concrete mathematics, NP-completeness, bioinformatics — so, data mining and artificial intelligence.
From 1976 until 1981 I studied Mathematics at Universiteit Leiden; during this period I also attended courses in Physics and Astronomy.
My PhD Thesis in the field of mathematics (1985, supervised by Professor Gerrit van Dijk from Universiteit Leiden) is entitled "Harmonic analysis on symmetric spaces"; some keywords: Lie groups, Plancherel formulas, Fourier analysis, spherical distributions, special functions.
Later on I became interested in computer science, in particular analysis of algorithms and artificial intelligence.

Research

Teaching

Publications

  1. A. Plaat, J. van den Herik and W. Kosters (editors), Computers and Games (CG2016), LNCS 10068, 2016; doi:10.1007/978-3-319-50935-8.
  2. M.J.H. van den Bergh, W.A. Kosters and F. Spieksma, Aspects of the cooperative card game Hanabi, BNAIC 2016, Amsterdam. Proceedings pages 25-32.
  3. K.J. Batenburg, L. Helwerda, W.A. Kosters and T. van der Meij, Agents for mobile radio tomography, BNAIC 2016, Amsterdam. Proceedings pages 17-24.
  4. H.J. van den Herik, W.A. Kosters and A. Plaat (editors), Recent Advances in Computer Games, special issue of Theoretical Computer Science, volume 644 (2016), pages 1-158; doi:10.1016/j.tcs.2016.07.026.
  5. A. Plaat, J. van den Herik and W. Kosters (editors), Advances in Computer Games (ACG2015), LNCS 9525, 2015; doi:10.1007/978-3-319-27992-3.
  6. M. Borassi, P. Crescenzi, M. Habib, W.A. Kosters, A. Marino and F.W. Takes, Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games, Theoretical Computer Science 586 (2015), 59-80; doi:10.1016/j.tcs.2015.02.033.
  7. H.J. Hoogeboom, W.A. Kosters, J. van Rijn and J.K. Vis, Acyclic Constraint Logic and Games, ICGA Journal 37 (2014), 3-16.
  8. F.W. Takes and W.A. Kosters, Adaptive Landmark Selection Strategies for Fast Shortest Path Computation in Large Real-World Graphs, Proceedings of the 13th IEEE/WIC/ACM International Conference on Web Intelligence (WI 2014), Warsaw, pp. 27-34; doi:10.1109/WI-IAT.2014.13.
  9. M. Schraagen and W.A. Kosters, Record Linkage using Graph Consistency, Machine Learning and Data Mining in Pattern Recognition (MLDM 2014), Saint Petersburg, LNAI 8556, pp. 471-483; doi:10.1007/978-3-319-08979-9_36.
  10. M. Borassi, P. Crescenzi, M. Habib, W.A. Kosters, A. Marino and F.W. Takes, On the Solvability of the Six Degrees of Kevin Bacon Game — A Faster Graph Diameter and Radius Computation Method, Proceedings of the 7th International Conference on Fun with Algorithms (FUN 2014), LNCS 8496, pp. 52-63; doi:10.1007/978-3-319-07890-8_5.
  11. G.H. Dal, W.A. Kosters and F.W. Takes, Fast Diameter Computation of Large Sparse Graphs using GPUs, Proceedings of the 22nd IEEE International Conference on Parallel, Distributed and Network-based Processing (PDP 2014), pp. 632-639; doi:10.1109/PDP.2014.17.
  12. A. Terroba, W. Kosters, J. Varona and C.S. Manresa-Yee, Finding Optimal Strategies in Tennis from Video Sequences, International Journal of Pattern Recognition and Artificial Intelligence 27, number 6 (2013); doi:10.1142/S0218001413550100.
  13. F.W. Takes and W.A. Kosters, Mining User-generated Path Traversal Patterns in an Information Network, Proceedings of the 12th IEEE/WIC/ACM International Conference on Web Intelligence (WI 2013), pp. 284-289; doi:10.1109/WI-IAT.2013.41.
  14. F.W. Takes and W.A. Kosters, Computing the Eccentricity Distribution of Large Graphs, Algorithms 6 (2013), 100-118; doi:10.3390/a6010100.
  15. K.J. Batenburg and W.A. Kosters, On the Difficulty of Nonograms, ICGA Journal 35 (2012), 195-205.
  16. R.D. Chatham, M. Doyle, R.J. Jeffers, W.A. Kosters, R.D. Skaggs and J.A. Ward, Centrosymmetric Solutions to Chessboard Separation Problems, Bulletin of the Institute of Combinatorics and its Applications 65 (2012), 14 pages.
  17. M. Luiten, W.A. Kosters and F.W. Takes, Topical Influence on Twitter: A Feature Construction Approach, The 24rd Benelux Conference on Artificial Intelligence (BNAIC 2012), 25-26 October 2012, Maastricht, The Netherlands. Proceedings pages 139-146.
  18. M. Schraagen and W.A. Kosters, Data-driven Name Reduction for Record Linkage, Second International Conference on Innovative Computing Technology (INTECH 2012), 18-20 September 2012, Casablanca, Marocco.
  19. F.W. Takes and W.A. Kosters, The Difficulty of Path Traversal in Information Networks, Fourth International Conference on Knowledge Discovery and Information retrieval (KDIR 2012), 4-7 October 2012, Barcelona, Spain. Proceedings pages 138-144.
  20. K.J. Batenburg and W.A. Kosters, Nonograms, Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica (Newsletter of the Dutch Organization for Theoretical Computer Science), 16 (2012), 49-62.
  21. F.W. Takes and W.A. Kosters, Identifying Prominent Actors in Online Social Networks using Biased Random Walks, The 23rd Benelux Conference on Artificial Intelligence (BNAIC 2011), 3-4 November 2011, Ghent, Belgium. Proceedings pages 215-222.
  22. J.K. Vis, W.A. Kosters and K.J. Batenburg, Discrete Tomography: A Neural Network Approach, The 23rd Benelux Conference on Artificial Intelligence (BNAIC 2011), 3-4 November 2011, Ghent, Belgium. Proceedings pages 328-335.
  23. F.W. Takes and W.A. Kosters, Determining the Diameter of Small World Networks, The 20th ACM Conference on Information and Knowledge Management, 24-28 October 2011, Glasgow, UK (CIKM 2011). Proceedings pages 1191-1196; doi:10.1145/2063576.2063748. (Also: 2 page abstract as ongoing work in Proceedings Benelearn 2011, pages 81-82.)
  24. A.M. Kentsch, W.A. Kosters, P. van der Putten and F.W. Takes, Exploratory Recommendations Using Wikipedia's Linking Structure, Twentieth Belgian Dutch Conference on Machine Learning (Benelearn 2011), The Hague, The Netherlands, May 20, 2011; Proceedings, pages 61-68.
  25. J.K. Vis, W.A. Kosters and A. Terroba, Tennis Patterns: Player, Match and Beyond, 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010), Luxembourg, 25-26 October 2010.
  26. F.W. Takes and W.A. Kosters, Applying Monte Carlo Techniques to the Capacitated Vehicle Routing Problem, 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010), Luxembourg, 25-26 October 2010.
  27. A. Terroba, W.A. Kosters and J.K. Vis, Tactical Analysis Modeling through Data Mining: Pattern Discovery in Racket Sports, International Conference on Knowledge Discovery and Information Retrieval (KDIR 2010), Valencia, Spain, 25-28 October 2010.
  28. W. Pijls and W.A. Kosters, Mining Frequent Itemsets: A Perspective from Operations Research, Statistica Neerlandica 64 (2010) 367-387; doi:10.1111/j.1467-9574.2010.00452.x.
  29. K.J. Batenburg, S. Henstra, W.A. Kosters and W.J. Palenstijn, Constructing Simple Nonograms of Varying Difficulty, Pure Mathematics and Applications (Pu.M.A.) 20 (2009), 1-15.
  30. J. Broekens, W.A. Kosters and T. de Vries, Eye Movements Disclose Decisions in Set, 21th Benelux Conference on Artificial Intelligence (BNAIC 2009), Eindhoven, The Netherlands, 29-30 October 2009; Proceedings (T. Calders, K. Tuyls and M. Pechenizkiy (editors)), pages 43-50.
  31. F.W. Takes and W.A. Kosters, Solving SameGame and its Chessboard Variant, 21th Benelux Conference on Artificial Intelligence (BNAIC 2009), Eindhoven, The Netherlands, 29-30 October 2009; Proceedings (T. Calders, K. Tuyls and M. Pechenizkiy (editors)), pages 249-256.
  32. K.J. Batenburg and W.A. Kosters, Solving Nonograms by Combining Relaxations, Pattern Recognition 42 (2009) 1672-1683; doi:10.1016/j.patcog.2008.12.003.
  33. T.K. Cocx, W.A. Kosters and J.F.J. Laros, An Early Warning System for the Prediction of Criminal Careers, 7th Mexican International Conference on Artificial Intelligence (MICAI 2008), Atizapán de Zaragoza, Mexico, October 27-31, 2008; Proceedings LNCS 5317, pages 77-89, A. Gelbukh and E.F. Morales, eds.; doi:10.1007/978-3-540-88636-5_7.
  34. D. Umanski, W.A. Kosters, F.J. Verbeek and N. Schiller, Integrating Computer Games in Speech Therapy for Children Who Stutter, 1st Workshop on Child, Computer and Interaction, Chania, Crete, Greece, October 23, 2008.
  35. E.H. de Graaf and W.A. Kosters, Visualizing Co-occurrence of Self-Optimizing Fragment Groups, 20th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2008), Enschede, The Netherlands, 30-31 October 2008; Proceedings pages 81-88 (A. Nijholt, M. Pantic, M. Poel and H. Hondorp, editors).
  36. K.J. Batenburg and W.A. Kosters, Automatic Generation of Japanese Puzzles, demo paper, 20th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2008), Enschede, The Netherlands, 30-31 October 2008; Proceedings pages 387-388 (A. Nijholt, M. Pantic, M. Poel and H. Hondorp, editors).
  37. J. Broekens, D. DeGroot and W.A. Kosters, Formal models of appraisal: Theory, specification, and computational model, Cognitive Systems Research 9 (2008), 173-197; doi:10.1016/j.cogsys.2007.06.007.
  38. T.K. Cocx, W.A. Kosters and J.F.J. Laros, Temporal Extrapolation within a Static Clustering, 17th International Symposium on Methodologies for Intelligent Systems (ISMIS'08), Toronto, Canada, May 21-23, 2008; Proceedings (editors An, A.; Matwin, S.; Ras, Z.W.; Slezak, D.); Springer LNAI 4994, pages 189-195, doi:10.1007/978-3-540-68123-6_21.
    See also 2 page overview, at the 20th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2008), Enschede, The Netherlands, 30-31 October 2008; Proceedings pages 295-296 (A. Nijholt, M. Pantic, M. Poel and H. Hondorp, editors).
  39. T.K. Cocx, W.A. Kosters and J.F.J. Laros, Enhancing the Automated Analysis of Criminal Careers, Workshop on Link Analysis, Counterterrorism, and Security (LATCS) at the SIAM International Data Mining Conference, Atlanta, USA, April 26, 2008.
  40. K.J. Batenburg and W.A. Kosters, A Reasoning Framework for Solving Nonograms, International Workshop on Combinatorial Image Analysis (IWCIA 2008), Buffalo, USA, April 7-9, 2008; Proceedings: LNCS 4958, pages 372-383, doi:10.1007/978-3-540-78275-9_33. See also a website for constructing Nonograms.
  41. E.H. de Graaf, J.N. Kok and W.A. Kosters, Mining Balanced Patterns in Web Access Data, The IASTED International Conference on Artificial Intelligence and Applications (AIA 2008), Proceedings paper 595-147 (A. Gammerman, editor), February 11-13, 2008, Innsbruck, Austria.
  42. H.J. Hoogeboom, J.F.J. Laros and W.A. Kosters, Selection of DNA Markers, IEEE Transactions on Systems, Man, and Cybernetics, Part C, 38, 26-32, 2008; doi:10.1109/TSMCC.2007.906060.
  43. E.H. de Graaf, J.N. Kok and W.A. Kosters, Displaying Co-occurrences of Patterns in Streams for Website Usage Analysis, 19th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2007), Utrecht, The Netherlands, 5-6 October 2007; Proceedings pages 143-150 (M.M. Dastani and E. de Jong, editors).
  44. W.A. Kosters and J.F.J. Laros, Visualization on a Closed Surface, 19th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2007), Utrecht, The Netherlands, 5-6 October 2007; Proceedings pages 189-195 (M.M. Dastani and E. de Jong, editors).
  45. T.K. Cocx and W.A. Kosters, Adapting and Visualizing Association Rule Mining Systems for Law Enforcement Purposes, 19th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2007), Utrecht, The Netherlands, 5-6 October 2007; Proceedings pages 88-95 (M.M. Dastani and E. de Jong, editors).
  46. E.H. de Graaf, J.N. Kok and W.A. Kosters, Clustering Improves the Exploration of Graph Mining Results, Artificial Intelligence and Innovations 2007: from Theory to Applications, Proceedings of the 4th IFIP International Conference on Artificial Intelligence Applications and Innovations (AIAI07), C. Boukis, A. Pnevmatikakis and L. Polymenakos (eds.), Springer, pages 13-20, Athens, Greece, 19-21 September 2007.
  47. J. Broekens, W.A. Kosters and F.J. Verbeek, On affect, anticipation and adaptation: Investigating the potential of affect-controlled selection of anticipatory simulation in artificial adaptive agents, Adaptive Behavior 15 (2007) 397-422; doi:10.1177/1059712307084686.
  48. W.A. Kosters and J.F.J. Laros, Metrics for Mining Multisets, Research and Development in Intelligent Systems XXIV, Proceedings of AI-2007, the Twenty-seventh SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (M. Bramer, F. Coenen, M. Petridis, editors), Springer, pages 293-303, Cambridge, UK, 10-12 December 2007.
    See also 2 page overview, at the 20th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2008), Enschede, The Netherlands, 30-31 October 2008; Proceedings pages 329-330 (A. Nijholt, M. Pantic, M. Poel and H. Hondorp, editors).
  49. E.H. de Graaf, J. Kazius, J.N. Kok and W.A. Kosters, Visualization and Grouping of Graph Patterns in Molecular Databases, Research and Development in Intelligent Systems XXIV, Proceedings of AI-2007, the Twenty-seventh SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (M. Bramer, F. Coenen, M. Petridis, editors), Springer, pages 267-280, Cambridge, UK, 10-12 December 2007.
  50. J. Broekens, W.A. Kosters and F.J. Verbeek, On Affect and Self-Adaptation: Potential Benefits of Valence-Controlled Action-Selection, 2nd International Work-Conference on the Interplay between Natural and Artificial Computation (IWINAC2007), Murcia (Spain), June 18-21, Lecture Notes in Artificial Intelligence 4527 (J. Mira and J.R. Álvarez, editors), pages 357-366, 2007; doi:10.1007/978-3-540-73053-8_36.
  51. K. Ye, W.A. Kosters and A.P. IJzerman, An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences, Bioinformatics 23 (2007) 687-693; doi:10.1093/bioinformatics/btl665.
  52. J.S. de Bruin, T.K. Cocx, W.A. Kosters, J.F.J. Laros and J.N. Kok, Data Mining Approaches to Criminal Career Analysis, Sixth IEEE International Conference on Data Mining (ICDM 2006), Proceedings pages 171-177 (C.W. Clifton, N. Zhong, J. Liu, B.W. Wah and X. Wu, editors), Hong Kong, China, 18-22 December 2006.
  53. E.H. de Graaf and W.A. Kosters, Mining for Stable Patterns: Regular Intervals between Occurrences, 18th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2006), Namur, Belgium, 5-6 October 2006; Proceedings pages 149-155 (P.-Y. Schobbens, W. Vanhoof and G. Schwanen, editors).
  54. J. Broekens, T. Cocx and W.A. Kosters, Object-Centered Interactive Multi-Dimensional Scaling: Ask the Expert, 18th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2006), Namur, Belgium, 5-6 October 2006; Proceedings pages 59-66 (P.-Y. Schobbens, W. Vanhoof and G. Schwanen, editors).
  55. C. Soares, E.H. de Graaf, J.N. Kok and W.A. Kosters, Sequence Mining on Web Access Logs: A Case Study, 18th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2006), Namur, Belgium, 5-6 October 2006; Proceedings pages 291-298 (P.-Y. Schobbens, W. Vanhoof and G. Schwanen, editors).
  56. J.S. de Bruin, T.K. Cocx, W.A. Kosters, J.F.J. Laros and J.N. Kok, Onto Clustering of Criminal Careers, ECML/PKDD-2006 Workshop on Practical Data Mining: Applications, Experiences and Challenges, Proceedings pages 90-93 (M. Ackermann, C. Soares and B. Guidemann, editors), Berlin, Germany, 22 September 2006.
  57. E.H. de Graaf, J.M. de Graaf and W.A. Kosters, Using Consecutive Support for Genomic Profiling, ECML/PKDD-2006 Workshop on Data and Text Mining for Integrative Biology, Proceedings pages 16-27 (M. Hilarion and C. Nédellec, editors), Berlin, Germany, 18 September 2006.
  58. T.K. Cocx and W.A. Kosters, A Distance Measure for Determining Similarity between Criminal Investigations, 6th Industrial Conference on Data Mining (ICDM) 2006, 14-15 July, Leipzig, Germany, Lecture Notes in Artificial Intelligence 4065 (P. Perner, editor), pages 511-525, 2006.
  59. K.J. Batenburg and W.A. Kosters, A Neural Network Approach to Real-time Discrete Tomography, International Workshop on Combinatorial Image Analysis (IWCIA) 2006, Berlin, Germany, 19-21 June, Lecture Notes in Computer Science 4040, (Ralf Reulke, Ulrich Eckardt, Boris Flach, Uwe Knauer, Konrad Polthier (editors)), pages 389-403, 2006.
  60. K.J. Batenburg and W.A. Kosters, Neural Networks for Discrete Tomography, BNAIC 2005, Brussels, Belgium, 17-18 October 2005; Proceedings pages 21-27 (K. Verbeeck, K. Tuyls, A. Nowé, B. Manderick and B. Kuijpers, editors).
  61. E.H. de Graaf and W.A. Kosters, Efficient Feature Detection for Sequence Classification in a Receptor Database, BNAIC 2005, Brussels, Belgium, 17-18 October 2005; Proceedings pages 81-88 (K. Verbeeck, K. Tuyls, A. Nowé, B. Manderick and B. Kuijpers, editors).
  62. E.H. de Graaf and W.A. Kosters, Using a Probable Time Window for Efficient Pattern Mining in a Receptor Database, Proceedings of the Third International Workshop on Mining Graphs, Trees and Sequences MGTS2005 (S. Nijssen, T. Meinl and G. Karypis, eds.), pages 13-24, 7 October 2005, Porto, Portugal.
  63. J.M. de Graaf, R.X. de Menezes, J.M. Boer and W.A. Kosters, Frequent Itemsets for Genomic Profiling, Computational Life Sciences, First International Symposium, CompLife 2005, Konstanz, Germany, 25-27 September 2005 (Proceedings (M.R. Berthold, R. Glen, K. Diederichs, O. Kohlbacher and I. Fischer, editors), LNCS 3695, pages 104-116).
  64. H.J. Hoogeboom and W.A. Kosters, The Theory of Tetris, Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica (Newsletter of the Dutch Organization for Theoretical Computer Science), 9 (2005), 14-21.
  65. H.J. Hoogeboom and W.A. Kosters, How to construct Tetris configurations, International Journal of Intelligent Games & Simulation (IJIGS), 3(2) 2005, 97-105; also: Technical Report 2003-8, LIACS, Universiteit Leiden.
  66. M.C. van Wezel and W.A. Kosters, Nonmetric Multidimensional Scaling: Neural Networks Versus Traditional Techniques, Intelligent Data Analysis 8 (2004), 601-613. (Upgraded version of BNAIC2003 paper below.)
  67. K.J. Batenburg and W.A. Kosters, A Discrete Tomography Approach to Japanese Puzzles, presented at BNAIC 2004, 21-22 October 2004, Groningen, The Netherlands (Proceedings (R. Verbrugge, N. Taatgen and L. Schomaker, editors) pages 243-250).
  68. J. Eggermont, J.N. Kok and W.A. Kosters, Detecting and Pruning Introns for Faster Decision Tree Evolution, presented at PPSN VIII, Birmingham, UK, 18-22 September 2004 (Proceedings (X. Yao, E. Burke, J.A. Lozano, J. Smith, J.J. Merelo-Guervós, J.A. Bullinaria, J. Rowe, P. Tino, A. Kabán and H.-P. Schwefel, editors), LNCS 3242, pages 1071-1080); poster small  | large — PPSN is a poster-only conference.
    Thanks to Leids Universiteits Fonds for a travel grant.
  69. R. Breukelaar, E.D. Demaine, S. Hohenberger, H.J. Hoogeboom, W.A. Kosters and D. Liben-Nowell. Tetris is Hard, Even to Approximate, International Journal of Computational Geometry and Applications (IJCGA) 14 (2004), 41-68.
  70. M. Prudencio, J. Rohovec, J. A. Peters, E. Tocheva, M. J. Boulanger, M. E. P. Murphy, H. J. Hupkes, W.A. Kosters, A. Impagliazzo and M. Ubbink, A caged lanthanide complex as paramagnetic shift agent for protein NMR, Chemistry — A European Journal 10 (2004), 3252-3260.
  71. J. Eggermont, J.N. Kok and W.A. Kosters, Genetic Programming for Data Classification: Partitioning the Search Space, presented at the 19th Annual ACM Symposium on Applied Computing (SAC'04), Nicosia, Cyprus, March 14-17, 2004 (Proceedings pages 1001-1005).
  72. H.J. Hoogeboom and W.A. Kosters, Tetris and Decidability, Information Processing Letters 89 (2004), 267-272; also: Technical Report 2003-10, LIACS, Universiteit Leiden.
  73. W.A. Kosters and W. Pijls, Apriori: A Depth First Implementation, presented (by Bart Goethals) at FIMI'03, the first Workshop on Frequent Itemset Mining Implementations, November 19, 2003, Melbourne, Florida, USA (CEUR Workshop Proceedings, ISSN 1613-0073, online; Bart Goethals and Mohammed J. Zaki (eds.)); see also more on the algorithm (including the current implementation).
  74. R. Breukelaar, H.J. Hoogeboom and W.A. Kosters, Tetris is Hard, Made Easy, Technical Report 2003-9, LIACS, Universiteit Leiden, 2003.
  75. M.C. van Wezel and W.A. Kosters, Nonmetric Multidimensional Scaling: Neural Networks Versus Traditional Techniques, presented at BNAIC 2003, October 23/24, 2003, Nijmegen, The Netherlands (Proceedings (T. Heskes, P. Lucas, L. Vuurpijl and W. Wiegerinck, editors), pages 331-338). (Upgraded version in Intelligent Data Analysis, see above.)
  76. J. Eggermont, J.N. Kok and W.A. Kosters, Genetic Programming for Data Classification: Refining the Search Space, presented at BNAIC 2003, October 23/24, 2003, Nijmegen, The Netherlands (Proceedings (T. Heskes, P. Lucas, L. Vuurpijl and W. Wiegerinck, editors), pages 123-130).
  77. W.A. Kosters, W. Pijls and V. Popova, Complexity Analysis of Depth First and FP-growth Implementations of Apriori, presented at MLDM 2003 (Machine Learning and Data Mining in Pattern Recognition), Leipzig, Germany, July 5-7, 2003 (Proceedings (P. Perner and A. Rosenfeld, editors), Lecture Notes in Artificial Intelligence 2734, Springer, pages 284-292).
    Thanks to Leids Universiteits Fonds for a travel grant.
  78. M.C. van Wezel and W.A. Kosters, Numerical Integration by Cubature Formulae in Bayesian Neural Networks, presented at ICONIP2003, Istanbul, Turkey, June 2003 (Supplementary Proceedings ICANN/ICONIP, pages 82-85) [upgraded version of the BNAIC 2002 paper below].
  79. W.A. Kosters and M.C. van Wezel, Competitive Neural Networks for Customer Choice Models, pages 41-60 in J. Segovia, P.S. Szczepaniak and M. Niedzwiedzinski, editors, E-Commerce and Intelligent Methods, Studies in Fuzziness and Soft Computing 105, Physica-Verlag, Springer, 2002 [enhanced version of the PADD'97 paper below].
  80. J.M. de Graaf, W.A. Kosters, W. Pijls and V. Popova, A Theoretical and Practical Comparison of Depth First and FP-growth Implementations of Apriori, presented at BNAIC 2002, October 21/22, 2002, Leuven, Belgium (Proceedings (H. Blockeel and M. Denecker, editors), pages 115-122).
  81. R.E. Keller, W.A. Kosters, M. van der Vaart and M.D.J. Witsenburg, Genetic Programming Produces Strategies for Agents in a Dynamic Environment, presented at BNAIC 2002, October 21/22, 2002, Leuven, Belgium (Proceedings (H. Blockeel and M. Denecker, editors), pages 171-178).
  82. M.C. van Wezel and W.A. Kosters, Numerical Integration by Cubature Formulae in Bayesian Neural Networks, presented at BNAIC 2002, October 21/22, 2002, Leuven, Belgium (Proceedings (H. Blockeel and M. Denecker, editors), pages 355-362).
  83. Two chapters in Dealing with the Data Flood: Mining Data, Text and Multimedia (J. Meij, editor), STT/Beweton, Den Haag, 2002 (publication STT 65):
    L. Kwee and W.A. Kosters, Future Cases: Data Mining in Virtual Organizations, Chapter 3.3.2, pages 335-341.
    W.A. Kosters, Neural Networks for Data Mining, Chapter 6.2.8, pages 641-645.
  84. M.C. van Wezel, W.A. Kosters, P. van der Putten and J.N. Kok, Nonmetric Multidimensional Scaling with Neural Networks, presented at IDA 2001 (Advances in Intelligent Data Analysis), The Fourth International Conference, Cascais, Portugal, September 13/15, 2001 (Proceedings, pages 145-155; Springer Lecture Notes in Computer Science 2189; editors: F. Hoffmann, D.J. Hand, N. Adams, D. Fisher and G. Guimaraes).
  85. J.M. de Graaf, W.A. Kosters and J.J.W. Witteman, Interesting Fuzzy Association Rules in Quantitative Databases, presented at PKDD 2001 (The 5th European Conference on Principles of Data Mining and Knowledge Discovery), Freiburg, Germany, September 3/5, 2001 (Proceedings Springer Lecture Notes in Artificial Intelligence 2168 (L. De Raedt and A. Siebes, editors), pages 140-151).
  86. J.M. de Graaf, W.A. Kosters and J.J.W. Witteman, Interesting Association Rules in Multiple Taxonomies (original version in PS), presented at BNAIC'00, Kaatsheuvel, November 1/2, 2000 (Proceedings (A. van den Bosch and H. Weigand, editors), pages 93-100); Interesting Association Rules in Multiple Taxonomies (slightly improved version in PDF).
  87. M.C. van Wezel, M.D. Out and W.A. Kosters, Ensembles of Nonconformist Neural Networks, presented at BNAIC'00, Kaatsheuvel, November 1/2, 2000 (Proceedings (A. van den Bosch and H. Weigand, editors), pages 165-172).
  88. J.N. Kok and W.A. Kosters, Natural Data Mining Techniques, Bulletin of the EATCS 71, June 2000, pages 133-142. Also published in Current Trends in Theoretical Computer Science (editors G. Paun, G. Rozenberg and A. Salomaa), World Scientific, Singapore, 2001, pages 603-613.
  89. M.D. Out and W.A. Kosters, A Bayesian Approach to Combined Neural Networks Forecasting, presented at ESANN'2000 (The 8th European Symposium on Artificial Neural Networks), Brugge, April 26/28, 2000 (Proceedings pages 323-328).
  90. W.A. Kosters, E. Marchiori and A. Oerlemans, Mining Clusters with Association Rules, presented at IDA99 (The Third Symposium on Intelligent Data Analysis), Amsterdam, August 9/11, 1999 (Proceedings, pages 39-50; Springer Lecture Notes in Computer Science 1642; editors: D.J. Hand, J.N. Kok and M.R. Berthold).
  91. W.A. Kosters, J.N. Kok and P. Floréen, Fourier Analysis of Genetic Algorithms, Theoretical Computer Science 229, 143-175, 1999.
  92. M.B. de Jong and W.A. Kosters, Adaptive Sampling, presented at NAIC'98, Amsterdam, November 18/19, 1998 (Proceedings (H. La Poutré and J. van den Herik, editors), pages 221-228).
  93. M.C. van Wezel, W.A. Kosters and J.N. Kok, Maximum Likelihood Weights for a Linear Ensemble of Regression Neural Networks, Proceedings ICONIP'98 (pages 498-501 (S. Usui and T. Omori, editors)), Japan, October 1998. A short survey was presented at NAIC'98, Amsterdam, November 18/19, 1998 (Proceedings (H. La Poutré and J. van den Herik, editors), pages 303-304).
  94. T. Bäck, J.M. de Graaf, J.N. Kok and W.A. Kosters, Theory of Genetic Algorithms, Bulletin of the EATCS 63, October 1997, pages 161-192. Also published in Current Trends in Theoretical Computer Science (editors G. Paun, G. Rozenberg and A. Salomaa), World Scientific, Singapore, 2001, pages 546-578. An extended abstract is also available, originally written for the 1998 newspaper of the Dutch Organization for Theoretical Computer Science (NVTI), pages 27-35.
  95. M.C. van Wezel, A.E. Eiben, C.M.H. van Kemenade, J.N. Kok, W.A. Kosters and I.G. Sprinkhuizen-Kuyper, Natural Solutions to Practical Problems: An Overview of Marketing, Scheduling and Information Filtering Problems Solved by Neural and Evolutionary Techniques, pages 202-205 in Neural Networks: Best Practice in Europe, Proceedings Conference SNN'97, Amsterdam, May 22, 1997, published by World Scientific, Singapore, 1997.
  96. M.C. van Wezel, J.N. Kok and W.A. Kosters, Two Neural Network Methods for Multidimensional Scaling, presented at ESANN'97 (European Symposium on Artificial Neural Networks), Brugge, April 16/18, 1997 (Proceedings pages 97-102; also: Technical Report 96-35, Universiteit Leiden, 1996).
  97. W.A. Kosters, J.A. La Poutré and M.C. van Wezel, Understanding Customer Choice Processes Using Neural Networks, presented at PADD'97 (First International Conference on the Practical Application of Knowledge Discovery and Data Mining), London, April 24/25, 1997 (Proceedings pages 167-178 (H.F. Arner Jr., editor) and at SNN'97, Amsterdam, May 22, 1997; also: Technical Report 96-33, Universiteit Leiden, 1996.
  98. J.M. de Graaf and W.A. Kosters, Expected Heights in Heaps, BIT 32 (1992), 570-579.
  99. W.A. Kosters, Harmonic Analysis on Symmetric Spaces, PhD Thesis, Universiteit Leiden, 1985 (consisting of the Eigenspaces and the Symplectic papers below).
  100. W.A. Kosters, Eigenspaces of the Laplace-Beltrami-operator on SL(n,R)/S(GL(1)xGL(n-1)), Part I, Indagationes Mathematicae 47 (1985), 99-123; Part II, Indagationes Mathematicae 47 (1985), 125-145. (Also: Technical Report 84-8, Universiteit Leiden, 1984.)
  101. W.A. Kosters, The Plancherel Formula for a Symplectic Symmetric Space, Technical Report 84-27, Universiteit Leiden, 1984.

Unpublished ;-)

  1. W.A. Kosters, Maze Traversals, Leiden, 2013.
  2. H.J.M. Goeman and W.A. Kosters, Triangular Heaps, Universiteit Leiden, 1996.
  3. J.M. de Graaf and W.A. Kosters, A Short Note on Hamiltonian Circuits in Subgraphs of the Triangulation Graph, Universiteit Leiden, 1988.
  4. D. Bruin and W.A. Kosters, Lindstrom Scanning and Link Inversion, Universiteit Leiden, 1987.
  5. W.A. Kosters, (f4(4),so(4,5)): A Survey of Results and Problems, Universiteit Leiden, 1985.

Contact information

Email: w.a.kosters@liacs.leidenuniv.nl
Address:
       Leiden Institute of Advanced Computer Science (LIACS)
       Universiteit Leiden
       P.O. Box 9512, 2300 RA Leiden, The Netherlands
Visiting address:
       Room 159, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
Phone: +31 (0)71-5277059


February 21, 2017 — http://www.liacs.leidenuniv.nl/~kosterswa/index.html