Остановите войну!
for scientists:
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 22 matches
- 2010
- Paulo J. Azevedo, Alípio Mário Jorge:
Ensembles of jittered association rule classifiers. Data Min. Knowl. Discov. 21(1): 91-129 (2010) - Eric Bae, James Bailey, Guozhu Dong:
A clustering comparison measure using density profiles and its application to the discovery of alternate clusterings. Data Min. Knowl. Discov. 21(3): 427-471 (2010) - José L. Balcázar, Francesco Bonchi, Aristides Gionis, Michèle Sebag:
Guest editors' introduction: special issue of selected papers from ECML PKDD 2010. Data Min. Knowl. Discov. 21(2): 221-223 (2010) - Bruno Baruque, Emilio Corchado:
A weighted voting summarization of SOM ensembles. Data Min. Knowl. Discov. 21(3): 398-426 (2010) - Toon Calders, Sicco Verwer:
Three naive Bayes approaches for discrimination-free classification. Data Min. Knowl. Discov. 21(2): 277-292 (2010) - Wei Chen, Zhenming Liu, Xiaorui Sun, Yajun Wang:
A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Discov. 21(2): 224-240 (2010) - Germán Creamer, Salvatore J. Stolfo:
Erratum to: A link mining algorithm for earnings forecast and trading. Data Min. Knowl. Discov. 21(3): 542 (2010) - Krzysztof Dembczynski, Wojciech Kotlowski, Roman Slowinski:
ENDER: a statistical framework for boosting decision rules. Data Min. Knowl. Discov. 21(1): 52-90 (2010) - Johannes Fürnkranz, Arno J. Knobbe:
Guest Editorial: Global modeling using local patterns. Data Min. Knowl. Discov. 21(1): 1-8 (2010) - Tamás Horváth, Jan Ramon, Stefan Wrobel:
Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21(3): 472-508 (2010) - Szymon Jaroszewicz:
Using interesting sequences to interactively build Hidden Markov Models. Data Min. Knowl. Discov. 21(1): 186-220 (2010) - Matthijs van Leeuwen:
Maximal exceptions with minimal descriptions. Data Min. Knowl. Discov. 21(2): 259-276 (2010) - Hassan H. Malik, John R. Kender, Dmitriy Fradkin, Fabian Mörchen:
Hierarchical document clustering using local patterns. Data Min. Knowl. Discov. 21(1): 153-185 (2010) - Dimitrios Mavroeidis:
Accelerating spectral clustering with partial supervision. Data Min. Knowl. Discov. 21(2): 241-258 (2010) - Aditya Krishna Menon, Charles Elkan:
Predicting labels for dyadic data. Data Min. Knowl. Discov. 21(2): 327-343 (2010) - Vit Niennattrakul, Pongsakorn Ruengronghirunya, Chotirat Ann Ratanamahatana:
Exact indexing for massive time series databases under time warping distance. Data Min. Knowl. Discov. 21(3): 509-541 (2010) - Siegfried Nijssen, Élisa Fromont:
Optimal constraint-based decision tree induction from itemset lattices. Data Min. Knowl. Discov. 21(1): 9-51 (2010) - Andrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin:
Mining top-K frequent itemsets through progressive sampling. Data Min. Knowl. Discov. 21(2): 310-326 (2010) - Carlos Ruiz, Myra Spiliopoulou, Ernestina Menasalvas Ruiz:
Density-based semi-supervised clustering. Data Min. Knowl. Discov. 21(3): 345-370 (2010) - Nikolaj Tatti, Michael Mampaey:
Using background knowledge to rank itemsets. Data Min. Knowl. Discov. 21(2): 293-309 (2010) - Bernd Wiswedel, Frank Höppner, Michael R. Berthold:
Learning in parallel universes. Data Min. Knowl. Discov. 21(1): 130-152 (2010) - Tianyi Wu, Yuguo Chen, Jiawei Han:
Re-examination of interestingness measures in pattern mining: a unified framework. Data Min. Knowl. Discov. 21(3): 371-397 (2010)
loading more results
failed to load more results, please try again later
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-04-28 14:04 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