SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Walter A. Kosters: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Kees Joost Batenburg, Walter A. Kosters
Neural Networks for Discrete Tomography. [Citation Graph (0, 0)][DBLP]
BNAIC, 2005, pp:21-27 [Conf]
Edgar H. de Graaf, Walter A. Kosters
Efficient Feature Detection for Sequence Classification in a Receptor Database. [Citation Graph (0, 0)][DBLP]
BNAIC, 2005, pp:81-88 [Conf]
Jeannette M. de Graaf, Renée X. de Menezes, Judith M. Boer, Walter A. Kosters
Frequent Itemsets for Genomic Profiling. [Citation Graph (0, 0)][DBLP]
CompLife, 2005, pp:104-116 [Conf]
Maurits D. Out, Walter A. Kosters
A Bayesian approach to combined neural networks forecasting. [Citation Graph (0, 0)][DBLP]
ESANN, 2000, pp:323-328 [Conf]
Michiel C. van Wezel, Joost N. Kok, Walter A. Kosters
Two neural network methods for multidimensional scaling. [Citation Graph (0, 0)][DBLP]
ESANN, 1997, pp:- [Conf]
Walter A. Kosters, Wim Pijls
Apriori, A Depth First Implementation. [Citation Graph (0, 0)][DBLP]
FIMI, 2003, pp:- [Conf]
Jeroen S. de Bruin, Tim K. Cocx, Walter A. Kosters, Jeroen F. J. Laros, Joost N. Kok
Data Mining Approaches to Criminal Career Analysis. [Citation Graph (0, 0)][DBLP]
ICDM, 2006, pp:171-177 [Conf]
Michiel C. van Wezel, Walter A. Kosters, Joost N. Kok
Maximum Likelihood Weights for a Linear Ensemble of Regression Neural Networks. [Citation Graph (0, 0)][DBLP]
ICONIP, 1998, pp:498-501 [Conf]
Walter A. Kosters, Elena Marchiori, Ard A. J. Oerlemans
Mining Clusters with Association Rules. [Citation Graph (0, 0)][DBLP]
IDA, 1999, pp:39-50 [Conf]
Michiel C. van Wezel, Walter A. Kosters, Peter van der Putten, Joost N. Kok
Nonmetric Multidimensional Scaling with Neural Networks. [Citation Graph (0, 0)][DBLP]
IDA, 2001, pp:145-155 [Conf]
Tim K. Cocx, Walter A. Kosters
A Distance Measure for Determining Similarity Between Criminal Investigations. [Citation Graph (0, 0)][DBLP]
Industrial Conference on Data Mining, 2006, pp:511-525 [Conf]
Kees Joost Batenburg, Walter A. Kosters
A Neural Network Approach to Real-Time Discrete Tomography. [Citation Graph (0, 0)][DBLP]
IWCIA, 2006, pp:389-403 [Conf]
Walter A. Kosters, Wim Pijls, Viara Popova
Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI. [Citation Graph (0, 0)][DBLP]
MLDM, 2003, pp:284-292 [Conf]
Jeannette M. de Graaf, Walter A. Kosters, Jeroen J. W. Witteman
Interesting Fuzzy Association Rules in Quantitative Databases. [Citation Graph (0, 0)][DBLP]
PKDD, 2001, pp:140-151 [Conf]
Jeroen Eggermont, Joost N. Kok, Walter A. Kosters
Detecting and Pruning Introns for Faster Decision Tree Evolution. [Citation Graph (0, 0)][DBLP]
PPSN, 2004, pp:1071-1080 [Conf]
Jeroen Eggermont, Joost N. Kok, Walter A. Kosters
Genetic Programming for data classification: partitioning the search space. [Citation Graph (0, 0)][DBLP]
SAC, 2004, pp:1001-1005 [Conf]
Kai Ye, Walter A. Kosters, Adriaan P. IJzerman
An efficient, versatile and scalable pattern growth approach to mine frequent patterns in unaligned protein sequences. [Citation Graph (0, 0)][DBLP]
Bioinformatics, 2007, v:23, n:6, pp:687-693 [Journal]
Jeannette M. de Graaf, Walter A. Kosters
Expected Heights in Heaps. [Citation Graph (0, 0)][DBLP]
BIT, 1992, v:32, n:4, pp:570-579 [Journal]
Joost N. Kok, Walter A. Kosters
Natural Data Mining Techniques. [Citation Graph (0, 0)][DBLP]
Bulletin of the EATCS, 2000, v:71, n:, pp:133-142 [Journal]
Michiel C. van Wezel, Walter A. Kosters
Nonmetric multidimensional scaling: Neural networks versus traditional techniques. [Citation Graph (0, 0)][DBLP]
Intell. Data Anal., 2004, v:8, n:6, pp:601-613 [Journal]
Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell
Tetris is hard, even to approximate. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:41-68 [Journal]
Hendrik Jan Hoogeboom, Walter A. Kosters
How to Construct Tetris Configurations. [Citation Graph (0, 0)][DBLP]
Int. J. Intell. Games & Simulation, 2004, v:3, n:2, pp:97-105 [Journal]
Hendrik Jan Hoogeboom, Walter A. Kosters
Tetris and decidability. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2004, v:89, n:6, pp:267-272 [Journal]
Walter A. Kosters, Joost N. Kok, Patrik Floréen
Fourier Analysis of Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1999, v:229, n:1, pp:143-175 [Journal]
Joost Broekens, Walter A. Kosters, Fons J. Verbeek
On Affect and Self-adaptation: Potential Benefits of Valence-Controlled Action-Selection. [Citation Graph (0, 0)][DBLP]
IWINAC (1), 2007, pp:357-366 [Conf]
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
Clustering Co-occurrence of Maximal Frequent Patterns in Streams [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
Clustering with Lattices in the Analysis of Graph Patterns [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
Mining Patterns with a Balanced Interval [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Edgar H. de Graaf, Jeannette de Graaf, Walter A. Kosters
Consecutive Support: Better Be Close! [Citation Graph (0, 0)][DBLP]
CoRR, 2006, v:0, n:, pp:- [Journal]
Clustering Improves the Exploration of Graph Mining Results. [Citation Graph (, )][DBLP]
Temporal Extrapolation within a Static Clustering. [Citation Graph (, )][DBLP]
A Reasoning Framework for Solving Nonograms. [Citation Graph (, )][DBLP]
An Early Warning System for the Prediction of Criminal Careers. [Citation Graph (, )][DBLP]
Visualization and Grouping of Graph Patterns in Molecular Databases. [Citation Graph (, )][DBLP]
Metrics for Mining Multisets. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP