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 33 matches
- 2007
- Hiroki Arimura, Takeaki Uno, Shinichi Shimozono:
Time and Space Efficient Discovery of Maximal Geometric Graphs. Discovery Science 2007: 42-55 - Paulo J. Azevedo, Alípio Mário Jorge:
Iterative Reordering of Rules for Building Ensembles Without Relearning. Discovery Science 2007: 56-67 - Avrim Blum:
A Theory of Similarity Functions for Learning and Clustering. Discovery Science 2007: 39 - Mario Boley:
On Approximating Minimum Infrequent and Maximum Frequent Sets. Discovery Science 2007: 68-77 - Thomas G. Dietterich:
Machine Learning in Ecosystem Informatics. Discovery Science 2007: 9-25 - Haytham Elghazel, Hamamache Kheddouci, Véronique Deslandres, Alain Dussauchoy:
A Partially Dynamic Clustering Algorithm for Data Insertion and Removal. Discovery Science 2007: 78-90 - Satoshi Fujishima, Yoshimasa Takahashi, Takashi Okada:
Pharmacophore Knowledge Refinement Method in the Chemical Structure Space. Discovery Science 2007: 243-247 - Jean-Gabriel Ganascia, Bassel Habib:
An Attempt to Rebuild C. Bernard's Scientific Steps. Discovery Science 2007: 248-252 - Hélène Hagège, Christopher Dartnell, Jean Sallantin:
Positivism Against Constructivism: A Network Game to Learn Epistemology. Discovery Science 2007: 91-103 - Gaëlle Hignette, Patrice Buche, Juliette Dibie-Barthélemy, Ollivier Haemmerlé:
Semantic Annotation of Data Tables Using a Domain Ontology. Discovery Science 2007: 253-258 - Jaakko Hollmén:
Model Selection and Estimation Via Subjective User Preferences. Discovery Science 2007: 259-263 - Liangxiao Jiang, Harry Zhang, Dianhong Wang, Zhihua Cai:
Learning Locally Weighted C4.4 for Class Probability Estimation. Discovery Science 2007: 104-115 - Heung-Nam Kim, Inay Ha, Jin-Guk Jung, GeunSik Jo:
User Preference Modeling from Positive Contents for Personalized Recommendation. Discovery Science 2007: 116-126 - Masaru Kitsuregawa:
Challenge for Info-plosion. Discovery Science 2007: 1-8 - Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara:
Reducing Trials by Thinning-Out in Skill Discovery. Discovery Science 2007: 127-138 - Shin-ichi Minato:
A Theoretical Study on Variable Ordering of Zero-Suppressed BDDs for Representing Frequent Itemsets. Discovery Science 2007: 139-150 - Tommi Mononen, Petri Myllymäki:
Fast NML Computation for Naive Bayes Models. Discovery Science 2007: 151-160 - Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda:
Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172 - Kyosuke Nishida, Koichiro Yamauchi:
Detecting Concept Drift Using Statistical Testing. Discovery Science 2007: 264-269 - Risa Nishiyama, Hironori Takeuchi, Hideo Watanabe:
Towards Future Technology Projection: A Method for Extracting Capability Phrases from Documents. Discovery Science 2007: 270-274 - Andrea Pietracaprina, Fabio Vandin:
Efficient Incremental Mining of Top-K Frequent Closed Itemsets. Discovery Science 2007: 275-280 - Oliver Ray, Katsumi Inoue:
A Consequence Finding Approach for Full Clausal Abduction. Discovery Science 2007: 173-184 - Hiroshi Sankoh, Koichiro Doi, Akihiro Yamamoto:
An Intentional Kernel Function for RNA Classification. Discovery Science 2007: 281-285 - Jürgen Schmidhuber:
Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity. Discovery Science 2007: 26-38 - Kazuhiro Seki, Javed Mostafa:
Literature-Based Discovery by an Enhanced Information Retrieval Model. Discovery Science 2007: 185-196 - Alexander J. Smola, Arthur Gretton, Le Song, Bernhard Schölkopf:
A Hilbert Space Embedding for Distributions. Discovery Science 2007: 40-41 - V. Suresh, Narayanan Raghupathy, B. Shekar, C. E. Veni Madhavan:
Discovering Mentorship Information from Author Collaboration Networks. Discovery Science 2007: 197-208 - Arkadiusz Tomczyk, Piotr S. Szczepaniak, Michal Pryczek:
Active Contours as Knowledge Discovery Methods. Discovery Science 2007: 209-218 - Hisashi Tosaka, Atsuyoshi Nakamura, Mineichi Kudo:
Mining Subtrees with Frequent Occurrence of Similar Subtrees. Discovery Science 2007: 286-290 - Takeaki Uno, Hiroki Arimura:
An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining. Discovery Science 2007: 219-230
skipping 3 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 2025-01-11 22:24 CET 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