Остановите войну!
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 17 matches
- 2014
- Annalisa Appice, Michelangelo Ceci, Corrado Loglisci, Giuseppe Manco, Elio Masciari, Zbigniew W. Ras:
New Frontiers in Mining Complex Patterns - Second International Workshop, NFMCP 2013, Held in Conjunction with ECML-PKDD 2013, Prague, Czech Republic, September 27, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8399, Springer 2014, ISBN 978-3-319-08406-0 [contents] - 2013
- Michael Davis, Weiru Liu, Paul Miller, Ruth F. Hunter, Frank Kee:
Agwan: A Generative Model for Labelled, Weighted Graphs. NFMCP 2013: 181-200 - Daniele Codecasa, Fabio Stella:
A Classification Based Scoring Function for Continuous Time Bayesian Network Classifiers. NFMCP 2013: 35-50 - Dominique Gay, Romain Guigourès, Marc Boullé, Fabrice Clérot:
Feature Extraction over Multiple Representations for Time Series Classification. NFMCP 2013: 18-34 - Jan Górecki, Martin Holena:
Structure Determination and Estimation of Hierarchical Archimedean Copulas Based on Kendall Correlation Matrix. NFMCP 2013: 132-147 - Pietro Hiram Guzzi, Pierangelo Veltri, Mario Cannataro:
Thresholding of Semantic Similarity Networks Using a Spectral Graph-Based Technique. NFMCP 2013: 201-213 - Rui Henriques, Cláudia Antunes, Sara C. Madeira:
Methods for the Efficient Discovery of Large Item-Indexable Sequential Patterns. NFMCP 2013: 100-116 - Takashi Katoh, Shin-ichiro Tago, Tatsuya Asai, Hiroaki Morikawa, Junichi Shigezumi, Hiroya Inakoshi:
Mining Frequent Partite Episodes with Partwise Constraints. NFMCP 2013: 117-131 - Vladimer Kobayashi:
A Hybrid Distance-Based Method and Support Vector Machines for Emotional Speech Detection. NFMCP 2013: 85-99 - Elzbieta Kubera, Alicja A. Wieczorkowska:
Mining Audio Data for Multiple Instrument Recognition in Classical Music. NFMCP 2013: 246-260 - Fabio Leuzzi, Stefano Ferilli, Fulvio Rotella:
A Relational Unsupervised Approach to Author Identification. NFMCP 2013: 214-228 - Jurica Levatic, Dragi Kocev, Saso Dzeroski:
The Use of the Label Hierarchy in Hierarchical Multi-label Classification Improves Performance. NFMCP 2013: 162-177 - Elio Masciari, Shi Gao, Carlo Zaniolo:
Trajectory Data Pattern Mining. NFMCP 2013: 51-66 - Amanda Cohen Mostafavi, Zbigniew W. Ras, Alicja A. Wieczorkowska:
From Personalized to Hierarchically Structured Classifiers for Retrieving Music by Mood. NFMCP 2013: 231-245 - Rebecca Ong, Mirco Nanni, Chiara Renso, Monica Wachowicz, Dino Pedreschi:
Parameter Estimation and Pattern Validation in Flock Mining. NFMCP 2013: 3-17 - Sonja Pravilovic, Annalisa Appice, Donato Malerba:
Process Mining to Forecast the Future of Running Cases. NFMCP 2013: 67-81 - Ivica Slavkov, Jana Karcheska, Dragi Kocev, Slobodan Kalajdziski, Saso Dzeroski:
ReliefF for Hierarchical Multi-label Classification. NFMCP 2013: 148-161
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-05-22 02:47 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