


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 65 matches
- 1999
- Gediminas Adomavicius, Alexander Tuzhilin:
User Profiling in Personalization Applications Through Rule Discovery and Validation. KDD 1999: 377-381 - Charu C. Aggarwal, Stephen C. Gates, Philip S. Yu:
On the Merits of Building Categorization Systems by Supervised Clustering. KDD 1999: 352-356 - Charu C. Aggarwal, Joel L. Wolf, Kun-Lung Wu, Philip S. Yu:
Horting Hatches an Egg: A New Graph-Theoretic Approach to Collaborative Filtering. KDD 1999: 201-212 - Rakesh Agrawal:
Data Mining: Crossing the Chasm (Invited talk, Abstract only). KDD 1999: 2 - Mihael Ankerst, Christian Elsen, Martin Ester, Hans-Peter Kriegel:
Visual Classification: An Interactive Approach to Decision Tree Construction. KDD 1999: 392-396 - Yonatan Aumann, Yehuda Lindell:
A Statistical Theory for Quantitative Association Rules. KDD 1999: 261-270 - Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arkun:
An Efficient Algorithm to Update Large Itemsets with Early Pruning. KDD 1999: 287-291 - Daniel Barbará, Xintao Wu:
Using Approximations to Scale Exploratory Data Analysis in Datacubes. KDD 1999: 382-386 - Stephen D. Bay, Michael J. Pazzani:
Detecting Change in Categorical Data: Mining Contrast Sets. KDD 1999: 302-306 - Roberto J. Bayardo Jr., Rakesh Agrawal:
Mining the Most Interesting Rules. KDD 1999: 145-154 - Kristin P. Bennett, Usama M. Fayyad, Dan Geiger:
Density-Based Indexing for Approximate Nearest-Neighbor Queries. KDD 1999: 233-243 - Francesco Bonchi, Fosca Giannotti, Gianni Mainetto, Dino Pedreschi:
A Classification-Based Methodology for Planning Audit Strategies in Fraud Detection. KDD 1999: 175-184 - Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert Wets:
Using Association Rules for Product Assortment Decisions: A Case Study. KDD 1999: 254-260 - Sergey Brin, Rajeev Rastogi, Kyuseok Shim:
Mining Optimized Gain Rules for Numeric Attributes. KDD 1999: 135-144 - Wray L. Buntine, Bernd Fischer, Thomas Pressburger:
Towards Automated Synthesis of Data Mining Programs. KDD 1999: 372-376 - Jesús Cerquides:
Applying General Bayesian Techniques to Improve TAN Induction. KDD 1999: 292-296 - Damianos Chatziantoniou:
The PanQ Tool and EMF SQL for Complex Data Management. KDD 1999: 420-424 - Chun Hung Cheng, Ada Wai-Chee Fu, Yi Zhang:
Entropy-based Subspace Clustering for Mining Numerical Data. KDD 1999: 84-93 - John Clear, Debbie Dunn, Brad Harvey, Michael L. Heytens, Peter Lohman, Abhay Mehta, Mark Melton, Lars Rohrberg, Ashok Savasere, Robert M. Wehrmeister, Melody Xu:
NonStop SQL/MX Primitives for Knowledge Discovery. KDD 1999: 425-429 - Corinna Cortes, Daryl Pregibon:
Information Mining Platforms: An Infrastructure for KDD Rapid Deployment. KDD 1999: 327-331 - Scott Davies, Andrew W. Moore:
Bayesian Networks for Lossless Dataset Compression. KDD 1999: 387-391 - Pedro M. Domingos:
MetaCost: A General Method for Making Classifiers Cost-Sensitive. KDD 1999: 155-164 - Guozhu Dong, Jinyan Li:
Efficient Mining of Emerging Patterns: Discovering Trends and Differences. KDD 1999: 43-52 - Jochen Dörre, Peter Gerstl, Roland Seiffert:
Text Mining: Finding Nuggets in Mountains of Textual Data. KDD 1999: 398-401 - William DuMouchel, Chris Volinsky, Theodore Johnson, Corinna Cortes, Daryl Pregibon:
Squashing Flat Files Flatter. KDD 1999: 6-15 - Wei Fan, Salvatore J. Stolfo, Junxin Zhang:
The Application of AdaBoost for Distributed, Scalable and On-Line Learning. KDD 1999: 362-366 - Tom Fawcett, Foster J. Provost:
Activity Monitoring: Noticing Interesting Changes in Behavior. KDD 1999: 53-62 - Scott Gaffney, Padhraic Smyth:
Trajectory Clustering with Mixtures of Regression Models. KDD 1999: 63-72 - Venkatesh Ganti, Johannes Gehrke
, Raghu Ramakrishnan:
CACTUS - Clustering Categorical Data Using Summaries. KDD 1999: 73-83 - Valery Guralnik, Jaideep Srivastava:
Event Detection from Time Series Data. KDD 1999: 33-42
skipping 35 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-03-07 04:26 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