Остановите войну!
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 89 matches
- 2002
- Deepak K. Agarwal:
Shrinkage estimator generalizations of Proximal Support Vector Machines. KDD 2002: 173-182 - Charu C. Aggarwal:
On effective classification of strings with wavelets. KDD 2002: 163-172 - Charu C. Aggarwal:
Collaborative crawling: mining user experiences for topical resource discovery. KDD 2002: 423-428 - Fatemah A. Alqallaf, Kjell P. Konis, R. Douglas Martin, Ruben H. Zamar:
Scalable robust covariance and correlation estimates for data mining. KDD 2002: 14-23 - Corin R. Anderson, Pedro M. Domingos, Daniel S. Weld:
Relational Markov models and their application to adaptive web navigation. KDD 2002: 143-152 - Peter Antal, Patrick Glenisson, Geert Fannes:
On the potential of domain literature for clustering and Bayesian network learning. KDD 2002: 405-414 - Jay Ayres, Jason Flannick, Johannes Gehrke, Tomi Yiu:
Sequential PAttern mining using a bitmap representation. KDD 2002: 429-435 - Florian Beil, Martin Ester, Xiaowei Xu:
Frequent term-based text clustering. KDD 2002: 436-442 - Shai Ben-David, Johannes Gehrke, Reba Schuller:
A theoretical framework for learning from a pool of disparate data sources. KDD 2002: 443-449 - Kristin P. Bennett, Ayhan Demiriz, Richard Maclin:
Exploiting unlabeled data in ensemble methods. KDD 2002: 289-296 - Kristin P. Bennett, Michinari Momma, Mark J. Embrechts:
MARK: a boosting algorithm for heterogeneous kernel models. KDD 2002: 24-31 - Ella Bingham, Heikki Mannila, Jouni K. Seppänen:
Topics in 0--1 data. KDD 2002: 450-455 - Olcay Boz:
Extracting decision trees from trained neural networks. KDD 2002: 456-461 - Cristian Bucila, Johannes Gehrke, Daniel Kifer, Walker M. White:
DualMiner: a dual-pruning algorithm for itemsets with constraints. KDD 2002: 42-51 - Bin Chen, Peter J. Haas, Peter Scheuermann:
A new two-phase sampling based algorithm for discovering association rules. KDD 2002: 462-468 - Darya Chudova, Padhraic Smyth:
Pattern discovery in sequences under a Markov assumption. KDD 2002: 153-162 - Christina Yip Chung, Bin Chen:
CVS: a Correlation-Verification based Smoothing technique on information retrieval and term clustering. KDD 2002: 469-474 - William W. Cohen, Jacob Richman:
Learning to match and cluster large high-dimensional data sets for data integration. KDD 2002: 475-480 - Vasa Curcin, Moustafa Ghanem, Yike Guo, Martin Köhler, Anthony Rowe, Jameel Syed, Patrick Wendel:
Discovery net: towards a grid of knowledge discovery. KDD 2002: 658-663 - Inderjit S. Dhillon, Subramanyam Mallela, Rahul Kumar:
Enhanced word clustering for hierarchical text classification. KDD 2002: 191-200 - Alin Dobra, Johannes Gehrke:
SECRET: a scalable linear regression tree algorithm. KDD 2002: 481-487 - Mohammad El-Ramly, Eleni Stroulia, Paul G. Sorenson:
From run-time behavior to usage scenarios: an interaction-pattern mining approach. KDD 2002: 315-324 - Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla:
Tina Eliassi-Rad, Terence Critchlow, Ghaleb Abdulla. KDD 2002: 488-494 - Martin Ester, Hans-Peter Kriegel, Matthias Schubert:
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web. KDD 2002: 249-258 - Alexandre V. Evfimievski, Ramakrishnan Srikant, Rakesh Agrawal, Johannes Gehrke:
Privacy preserving mining of association rules. KDD 2002: 217-228 - Bin Fang, Wynne Hsu, Mong-Li Lee:
Tumor cell identification using features rules. KDD 2002: 495-500 - Dimitris Fragoudis, Dimitris Meretakis, Spiros Likothanassis:
Integrating feature and instance selection for text classification. KDD 2002: 501-506 - Hichem Frigui:
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets. KDD 2002: 507-512 - Shantanu Godbole, Sunita Sarawagi, Soumen Chakrabarti:
Scaling multi-class support vector machines using inter-class confusion. KDD 2002: 513-518 - Tu Bao Ho, Trong Dung Nguyen, DucDung Nguyen:
Visualization support for a user-centered KDD process. KDD 2002: 519-524
skipping 59 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-05-31 07:49 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