Остановите войну!
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 32 matches
- 2008
- Timo Aho, Tapio Elomaa, Jussi Kujala:
Unsupervised Classifier Selection Based on Two-Sample Test. Discovery Science 2008: 28-39 - José L. Balcázar:
Deduction Schemes for Association Rules. Discovery Science 2008: 124-135 - Gauvain Bourgne, Vincent Corruble:
A Framework for Knowledge Discovery in a Society of Agents. Discovery Science 2008: 172-184 - Imre Csiszár:
On Iterative Algorithms with an Information Geometry Background. Discovery Science 2008: 1 - Christopher Dartnell, Eric Martin, Jean Sallantin:
Learning from Each Other. Discovery Science 2008: 148-159 - Haytham Elghazel, Tetsuya Yoshida, Mohand-Said Hacid:
An Integrated Graph and Probability Based Clustering Framework for Sequential Data. Discovery Science 2008: 246-258 - Alberto Faro, Daniela Giordano, Francesco Maiorana:
Input Noise Robustness and Sensitivity Analysis to Improve Large Datasets Clustering by Using the GRID. Discovery Science 2008: 234-245 - Gemma C. Garriga, Antti Ukkonen, Heikki Mannila:
Feature Selection in Taxonomies with Applications to Paleontology. Discovery Science 2008: 112-123 - Kurt De Grave, Jan Ramon, Luc De Raedt:
Active Learning for High Throughput Screening. Discovery Science 2008: 185-196 - Fedja Hadzic, Henry Tan, Tharam S. Dillon:
Mining Unordered Distance-Constrained Embedded Subtrees. Discovery Science 2008: 272-283 - Natthakan Iam-on, Tossapon Boongoen, Simon M. Garrett:
Refining Pairwise Similarity Matrix for Cluster Ensemble Problem with Cluster Relations. Discovery Science 2008: 222-233 - Elena Ikonomovska, João Gama:
Learning Model Trees from Data Streams. Discovery Science 2008: 52-63 - Akihiko Izutani, Kuniaki Uehara:
A Modeling Approach Using Multiple Graphs for Semi-Supervised Learning. Discovery Science 2008: 296-307 - Frederik Janssen, Johannes Fürnkranz:
An Empirical Investigation of the Trade-Off between Consistency and Coverage in Rule Learning Heuristics. Discovery Science 2008: 40-51 - Ata Kabán:
A Probabilistic Neighbourhood Translation Approach for Non-standard Text Categorisation. Discovery Science 2008: 332-343 - Daniel A. Keim, Florian Mansmann, Daniela Oelke, Hartmut Ziegler:
Visual Analytics: Combining Automated Discovery with Interactive Visualizations. Discovery Science 2008: 2-14 - Wolfgang Kienreich, Peter Kraker:
Comparative Evaluation of Two Systems for the Visual Navigation of Encyclopedia Knowledge Spaces. Discovery Science 2008: 160-171 - Mikko Korpela, Harri Mäkinen, Mika Sulkava, Pekka Nöjd, Jaakko Hollmén:
Smoothed Prediction of the Onset of Tree Stem Radius Increase Based on Temperature Patterns. Discovery Science 2008: 100-111 - László Lovász:
Some Mathematics Behind Graph Property Testing. Discovery Science 2008: 15 - Heikki Mannila:
Finding Total and Partial Orders from Data for Seriation. Discovery Science 2008: 16-25 - Tom M. Mitchell:
Computational Models of Neural Representations in the Human Brain. Discovery Science 2008: 26-27 - Seiji Murakami, Koichiro Doi, Akihiro Yamamoto:
Finding Frequent Patterns from Compressed Tree-Structured Data. Discovery Science 2008: 284-295 - Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:
String Kernels Based on Variable-Length-Don't-Care Patterns. Discovery Science 2008: 308-318 - Frédéric Pennerath, Géraldine Polaillon, Amedeo Napoli:
Mining Intervals of Graphs to Extract Characteristic Reaction Patterns. Discovery Science 2008: 210-221 - Beau Piccart, Jan Struyf, Hendrik Blockeel:
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees. Discovery Science 2008: 64-75 - Leander Schietgat, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel:
An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules. Discovery Science 2008: 197-209 - Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin:
Constructing Iceberg Lattices from Frequent Closures Using Generators. Discovery Science 2008: 136-147 - Kadim Tasdemir, Erzsébet Merényi:
Cluster Analysis in Remote Sensing Spectral Imagery through Graph Representation and Advanced SOM Visualization. Discovery Science 2008: 259-271 - Takashi Uemura, Daisuke Ikeda, Hiroki Arimura:
Unsupervised Spam Detection by Document Complexity Estimation. Discovery Science 2008: 319-331 - Werner Uwents, Hendrik Blockeel:
A Comparison between Neural Network Methods for Learning Aggregate Functions. Discovery Science 2008: 88-99
skipping 2 more matches
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-07-20 06:58 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