Остановите войну!
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 67 matches
- 1998
- Naoki Abe, Hiroshi Mamitsuka:
Query Learning Strategies Using Boosting and Bagging. ICML 1998: 1-9 - Ricardo Aler, Daniel Borrajo, Pedro Isasi:
Genetic Programming and Deductive-Inductive Learning: A Multi-Strategy Approach. ICML 1998: 10-18 - Cosimo Anglano, Attilio Giordana, Giuseppe Lo Bello, Lorenza Saitta:
An Experimental Evaluation of Coevolutive Concept Learning. ICML 1998: 19-27 - Jonathan Baxter, Andrew Tridgell, Lex Weaver:
KnightCap: A Chess Programm That Learns by Combining TD(lambda) with Game-Tree Search. ICML 1998: 28-36 - Stephen D. Bay:
Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. ICML 1998: 37-45 - Daniel Billsus, Michael J. Pazzani:
Learning Collaborative Information Filters. ICML 1998: 46-54 - Hendrik Blockeel, Luc De Raedt, Jan Ramon:
Top-Down Induction of Clustering Trees. ICML 1998: 55-63 - Kurt D. Bollacker, Joydeep Ghosh:
A Supra-Classifier Architecture for Scalable Knowledge Reuse. ICML 1998: 64-72 - Blai Bonet, Hector Geffner:
Learning Sorting and Decision Trees with POMDPs. ICML 1998: 73-81 - Paul S. Bradley, Usama M. Fayyad:
Refining Initial Points for K-Means Clustering. ICML 1998: 91-99 - Paul S. Bradley, Olvi L. Mangasarian:
Feature Selection via Concave Minimization and Support Vector Machines. ICML 1998: 82-90 - Nicolò Cesa-Bianchi, Paul Fischer:
Finite-Time Regret Bounds for the Multiarmed Bandit Problem. ICML 1998: 100-108 - Nello Cristianini, John Shawe-Taylor, Peter Sykacek:
Bayesian Classifiers Are Large Margin Hyperplanes in a Hilbert Space. ICML 1998: 109-117 - Thomas G. Dietterich:
The MAXQ Method for Hierarchical Reinforcement Learning. ICML 1998: 118-126 - Pedro M. Domingos:
A Process-Oriented Heuristic for Model Selection. ICML 1998: 127-135 - Saso Dzeroski, Luc De Raedt, Hendrik Blockeel:
Relational Reinforcement Learning. ICML 1998: 136-143 - Eibe Frank, Ian H. Witten:
Generating Accurate Rule Sets Without Global Optimization. ICML 1998: 144-151 - Eibe Frank, Ian H. Witten:
Using a Permutation Test for Attribute Selection in Decision Trees. ICML 1998: 152-160 - Dayne Freitag:
Multistrategy Learning for Information Extraction. ICML 1998: 161-169 - Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yoram Singer:
An Efficient Boosting Algorithm for Combining Preferences. ICML 1998: 170-178 - Nir Friedman, Moisés Goldszmidt, Thomas J. Lee:
Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting. ICML 1998: 179-187 - Thilo-Thomas Frieß, Nello Cristianini, Colin Campbell:
The Kernel-Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines. ICML 1998: 188-196 - Zoltán Gábor, Zsolt Kalmár, Csaba Szepesvári:
Multi-criteria Reinforcement Learning. ICML 1998: 197-205 - João Gama:
Local Cascade Generalization. ICML 1998: 206-214 - Frédérick Garçia, Seydina M. Ndiaye:
A Learning Rate Analysis of Reinforcement Learning Algorithms in Finite-Horizon. ICML 1998: 215-223 - Diana F. Gordon:
Well-Behaved Borgs, Bolos, and Berserkers. ICML 1998: 224-232 - Tom Heskes:
Solving a Huge Number of Similar Tasks: A Combination of Multi-Task Learning and a Hierarchical Bayesian Approach. ICML 1998: 233-241 - Junling Hu, Michael P. Wellman:
Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm. ICML 1998: 242-250 - Hugues Juillé, Jordan B. Pollack:
Coevolutionary Learning: A Case Study. ICML 1998: 251-259 - Michael J. Kearns, Yishay Mansour:
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization. ICML 1998: 269-277
skipping 37 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-08-31 22:22 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