![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 46 matches
- 2001
- Jafar Adibi, Wei-Min Shen:
Self-Similar Layered Hidden Markov Models. PKDD 2001: 1-15 - Massih-Reza Amini, Patrick Gallinari:
Automatic Text Summarization Using Unsupervised and Semi-supervised Learning. PKDD 2001: 16-28 - Hendrik Blockeel
, Johannes Fürnkranz, Alexia Prskawetz, Francesco C. Billari:
Detecting Temporal Change in Event Sequences: An Application to Demographic Data. PKDD 2001: 29-41 - Amanda Clare, Ross D. King:
Knowledge Discovery in Multi-label Phenotype Data. PKDD 2001: 42-53 - Frans Coenen
, Graham Goulbourne, Paul H. Leng:
Computing Association Rules Using Partial Totals. PKDD 2001: 54-66 - Clare Bates Congdon:
Gaphyl: A Genetic Algorithms Approach to Cladistics. PKDD 2001: 67-78 - Thomas G. Dietterich, Xin Wang:
Support Vectors for Reinforcement Learning. PKDD 2001: 492 - Ömer Egecioglu:
Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. PKDD 2001: 79-90 - Vladimir Estivill-Castro, Michael E. Houle:
Data Structures for Minimization of Total Within-Group Distance for Spatio-temporal Clustering. PKDD 2001: 91-102 - Vladimir Estivill-Castro, Jianhua Yang:
Non-crisp Clustering by Fast, Convergent, and Robust Algorithms. PKDD 2001: 103-114 - Pierre Geurts:
Pattern Extraction for Time Series Classification. PKDD 2001: 115-127 - Fosca Giannotti, Giuseppe Manco
, Franco Turini:
Specifying Mining Algorithms with Iterative User-Defined Aggregates: A Case Study. PKDD 2001: 128-139 - Jeannette M. de Graaf, Walter A. Kosters, Jeroen J. W. Witteman:
Interesting Fuzzy Association Rules in Quantitative Databases. PKDD 2001: 140-151 - Attila Gyenesei:
Interestingness Measures for Fuzzy Association Rules. PKDD 2001: 152-164 - Maria Halkidi, Michalis Vazirgiannis:
A Data Set Oriented Approach for Clustering Algorithm Selection. PKDD 2001: 165-179 - Melanie Hilario, Alexandros Kalousis:
Fusion of Meta-knowledge and Meta-data for Case-Based Model Selection. PKDD 2001: 180-191 - Rie Honda, Osamu Konishi:
Temporal Rule Discovery for Time-Series Satellite Images and Integration with RDB. PKDD 2001: 204-215 - Theodore W. Hong, Keith L. Clark:
Using Grammatical Inference to Automate Information Extraction from the Web. PKDD 2001: 216-227 - Frank Höppner:
Discovery of Temporal Patterns. Learning Rules about the Qualitative Behaviour of Time Series. PKDD 2001: 192-203 - Yuh-Jyh Hu:
Biological Sequence Data Mining. PKDD 2001: 228-240 - Eyke Hüllermeier:
Implication-Based Fuzzy Association Rules. PKDD 2001: 241-252 - Szymon Jaroszewicz
, Dan A. Simovici:
A General Measure of Rule Interestingness. PKDD 2001: 253-265 - Jörg Kindermann, Gerhard Paass, Edda Leopold:
Error Correcting Codes with Optimized Kullback-Leibler Distances for Text Categorization. PKDD 2001: 266-276 - Arno J. Knobbe, Marc de Haas, Arno Siebes:
Propositionalisation and Aggregates. PKDD 2001: 277-288 - Sergei O. Kuznetsov, Sergei A. Obiedkov:
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. PKDD 2001: 289-300 - Aleksandar Lazarevic, Zoran Obradovic:
Data Reduction Using Multiple Models Integration. PKDD 2001: 301-313 - Heikki Mannila:
Combining Discrete Algorithmic and Probabilistic Approaches in Data Mining. PKDD 2001: 493 - Roberto R. F. Mendes, Fabricio de B. Voznika, Alex Alves Freitas
, Júlio C. Nievola:
Discovering Fuzzy Classification Rules with Genetic Programming and Co-evolution. PKDD 2001: 314-325 - Claire Nedellec
, Mohamed Ould Abdel Vetah, Philippe Bessières:
Sentence Filtering for Information Extraction in Genomics, a Classification Problem. PKDD 2001: 326-337 - Jörg Ontrup, Helge J. Ritter:
Text Categorization and Semantic Browsing with Self-Organizing Maps on Non-euclidean Spaces. PKDD 2001: 338-349
skipping 16 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-09 15:43 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint