Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Wim Pijls"'
Autor:
Walter A. Kosters, Wim Pijls
Publikováno v:
Statistica Neerlandica. 64:367-387
Mining frequent itemsets is a flourishing research area. Many papers on this topic have been published and even some contests have been held. Most papers focus on speed and introduce ad hoc algorithms and data structures. In this paper we put most of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a0673b65f5e6b2c463bf914f6563626
https://doi.org/10.1111/j.1467-9574.2010.00452.x
https://doi.org/10.1111/j.1467-9574.2010.00452.x
Autor:
Wim Pijls, Aad Goddijn
Publikováno v:
Mathematics Magazine, 215-219
STARTPAGE=215;ENDPAGE=219;TITLE=Mathematics Magazine
STARTPAGE=215;ENDPAGE=219;TITLE=Mathematics Magazine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::202595091e513d51e8efffbe827a48c2
https://doi.org/10.1080/0025570x.2007.11953484
https://doi.org/10.1080/0025570x.2007.11953484
Autor:
Wim Pijls
Publikováno v:
Statistica Neerlandica, 61(1), 61-74. Wiley-Blackwell Publishing Ltd
Shortest path problems occupy an important position in operations research as well as in artificial intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c0a62a6f3f1b1eb380e419c0fbd341a
https://doi.org/10.1111/j.1467-9574.2007.00348.x
https://doi.org/10.1111/j.1467-9574.2007.00348.x
Autor:
Wim Pijls
Publikováno v:
American Mathematical Monthly, 108(6), 537-543. Mathematical Association of America
1. INTRODUCTION. In this paper, we discuss two mathematical topics that are closely related to cartography. Cartography deals with the problem of mapping the globe into a plane. The most widely used mapping in cartography is the Mercator mapping, als
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1996c3f77d5c1b20937bcca1aa4a1b7
https://doi.org/10.1080/00029890.2001.11919781
https://doi.org/10.1080/00029890.2001.11919781
Autor:
Wim Pijls
Publikováno v:
SIGCSE Bulletin, 1(1), 1-6. Association for Computing Machinery (ACM)
The two best known parsing algorithms are LR and LL parsing respectively. These algorithms are explained extensively in the vast literature on compiler construction and formal language theory. In almost any textbook, LR and LL are regarded as two dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6db36c35fdb61c409feffaea580c8a8
https://doi.org/10.1145/369295.369315
https://doi.org/10.1145/369295.369315
Publikováno v:
Artificial Intelligence. 87(1-2):255-293
This article has three main contributions to our understanding of minimax search: First, a new formulation for Stockman's SSS ∗ algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS ∗ , finally transforming it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15b9eb8a4760dbb037cb5c9d770248b5
Publikováno v:
ICGA Journal. 17:207-219
textabstractA game tree algorithm is an algorithm computing the minimax value of the root of a game tree. Many algorithms use the notion of establishing proofs that this value lies above or below some boundary value. We show that this amounts to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::355e2c6d5e3bf9449a1ea4dbc43970e0
https://doi.org/10.3233/icg-1994-17404
https://doi.org/10.3233/icg-1994-17404
Autor:
Wim Pijls, Arie de Bruin
Publikováno v:
ICGA Journal. 16:18-30
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::536320351b56c5e780cc0b02d38153ed
https://doi.org/10.3233/icg-1993-16103
https://doi.org/10.3233/icg-1993-16103
Publikováno v:
European Journal of Operational Research, 198(2), 363-369. Elsevier
For finding a shortest path in a network bidirectional A ∗ is a widely known algorithm. This algorithm distinguishes between the main phase and the postprocessing phase. The version of bidirectional A ∗ that is considered the most appropriate in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0645e3cbc18db0d155e6656efbddc368
https://pure.eur.nl/en/publications/4d7a2296-6f45-4aec-9d53-dc66e25abe53
https://pure.eur.nl/en/publications/4d7a2296-6f45-4aec-9d53-dc66e25abe53
Publikováno v:
Lecture Notes in Artificial Intelligence, 2734, 284-292
Machine Learning and Data Mining in Pattern Recognition ISBN: 9783540405047
MLDM
Machine Learning and Data Mining in Pattern Recognition ISBN: 9783540405047
MLDM
We examine the complexity of Depth First and FP-growth implementations of Apriori, two of the fastest known data mining algorithms to find frequent itemsets in large databases. We describe the algorithms in a similar style, derive theoretical formula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4b890c60c2202f22b389525644cda83
https://pure.eur.nl/en/publications/1a607319-6d4d-4fe2-88d7-ade261d74f5f
https://pure.eur.nl/en/publications/1a607319-6d4d-4fe2-88d7-ade261d74f5f