Остановите войну!
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 69 matches
- 1998
- Charu C. Aggarwal, Zheng Sun, Philip S. Yu:
Online Generation of Profile Association Rules. KDD 1998: 129-133 - Khaled Alsabti, Sanjay Ranka, Vineet Singh:
CLOUDS: A Decision Tree Classifier for Large Datasets. KDD 1998: 2-8 - Brigham S. Anderson, Andrew W. Moore:
ADtrees for Fast Counting and for Fast Learning of Association Rules. KDD 1998: 134-138 - Stefan Berchtold, H. V. Jagadish, Kenneth A. Ross:
Independence Diagrams: A Technique for Visual Data Mining. KDD 1998: 139-143 - Siddhartha Bhattacharyya:
Direct Marketing Response Models Using Genetic Algorithms. KDD 1998: 144-148 - José Luís Cabral de Moura Borges, Mark Levene:
Mining Association Rules in Hypertext Databases. KDD 1998: 149-153 - Paul S. Bradley, Usama M. Fayyad, Cory Reina:
Scaling Clustering Algorithms to Large Databases. KDD 1998: 9-15 - John V. Carlis, Elizabeth Shoop, Scott Krieger:
Blurring the Distinction between Command and Data in Scientific KDD. KDD 1998: 154-158 - Ernest P. Chan, Santiago Garcia, Salim Roukos:
Probabilistic Modeling for Information Retrieval with Unsupervised Training Data. KDD 1998: 159-163 - Philip K. Chan, Salvatore J. Stolfo:
Toward Scalable Learning with Non-Uniform Class and Cost Distributions: A Case Study in Credit Card Fraud Detection. KDD 1998: 164-168 - William W. Cohen, Haym Hirsh:
Joins that Generalize: Text Classification Using WHIRL. KDD 1998: 169-173 - Corinna Cortes, Daryl Pregibon:
Giga-Mining. KDD 1998: 174-178 - Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, Padhraic Smyth:
Rule Discovery from Time Series. KDD 1998: 16-22 - Gautam Das, Heikki Mannila, Pirjo Ronkainen:
Similarity of Attributes by External Probes. KDD 1998: 23-29 - Anne Debregeas, Georges Hébrail:
Interactive Interpretation of Kohonen Maps Applied to Curves. KDD 1998: 179-183 - Luc Dehaspe, Hannu Toivonen, Ross D. King:
Finding Frequent Substructures in Chemical Compounds. KDD 1998: 30-36 - Pedro M. Domingos:
Occam's Two Razors: The Sharp and the Blunt. KDD 1998: 37-43 - Carmel Domshlak, D. Gershkovich, Ehud Gudes, N. Liusternik, Amnon Meisels, Tzachi Rosen, Solomon Eyal Shimony:
FlexiMine - A Flexible Platform for KDD Research and Application Construction. KDD 1998: 184-188 - William DuMouchel, Matthias Schonlau:
A Fast Computer Intrusion Detection Algorithm Based on Hypothesis Testing of Command Transition Probabilities. KDD 1998: 189-193 - Martin Ester, Alexander Frommelt, Hans-Peter Kriegel, Jörg Sander:
Algorithms for Characterization and Trend Detection in Spatial Databases. KDD 1998: 44-50 - Usama M. Fayyad, Cory Reina, Paul S. Bradley:
Initialization of Iterative Refinement Clustering Algorithms. KDD 1998: 194-198 - A. J. Feelders, Soong Chang, Geoffrey J. McLachlan:
Mining in the Presence of Selectivity Bias and its Application to Reject Inference. KDD 1998: 199-203 - Arnold Goodman, John F. Elder IV:
Knowledge Discovery and the Interface of Computing and Statistics. KDD 1998: 375-378 - Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri:
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases. KDD 1998: 204-208 - Dan L. Grecu, Lee A. Becker:
Coactive Learning for Distributed Data Mining. KDD 1998: 209-213 - Valery Guralnik, Duminda Wijesekera, Jaideep Srivastava:
Pattern Directed Mining of Sequence Data. KDD 1998: 51-57 - Jiawei Han, Wan Gong, Yiwen Yin:
Mining Segment-Wise Periodic Patterns in Time-Related Databases. KDD 1998: 214-218 - Simon Handley, Pat Langley, Folke A. Rauscher:
Learning to Predict the Duration of an Automobile Trip. KDD 1998: 219-223 - Alexander Hinneburg, Daniel A. Keim:
An Efficient Approach to Clustering in Large Multimedia Databases with Noise. KDD 1998: 58-65 - Theodore Johnson, Tamraparni Dasu:
Comparing Massive High-Dimensional Data Sets. KDD 1998: 229-233
skipping 39 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-19 12:17 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