Остановите войну!
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 80 matches
- 2000
- Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad:
Depth first generation of long patterns. KDD 2000: 108-118 - Charu C. Aggarwal, Philip S. Yu:
The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space. KDD 2000: 119-129 - Mihael Ankerst, Martin Ester, Hans-Peter Kriegel:
Towards an effective cooperation of the user and the computer for classification. KDD 2000: 179-188 - Daniel Barbará, Ping Chen:
Using the fractal dimension to cluster datasets. KDD 2000: 260-264 - Stephen D. Bay:
Multivariate discretization of continuous variables for set mining. KDD 2000: 315-319 - Jonathan D. Becher, Pavel Berkhin, Edmund Freeman:
Automating exploratory data analysis for efficient data mining. KDD 2000: 424-429 - Doug Beeferman, Adam L. Berger:
Agglomerative clustering of a search engine query log. KDD 2000: 407-416 - Siddhartha Bhattacharyya:
Evolutionary algorithms in data mining: multi-objective performance modeling for direct marketing. KDD 2000: 465-473 - Tom Brijs, Bart Goethals, Gilbert Swinnen, Koen Vanhoof, Geert Wets:
A data mining framework for optimal product selection in retail supermarket data: the generalized PROFSET model. KDD 2000: 300-304 - Bruce G. Buchanan:
Informed knowledge discovery: using prior knowledge in discovery programs (invited talk, abstract only). KDD 2000: 3 - Igor V. Cadez, Scott Gaffney, Padhraic Smyth:
A general probabilistic framework for clustering individuals and objects. KDD 2000: 140-149 - Igor V. Cadez, David Heckerman, Christopher Meek, Padhraic Smyth, Steven White:
Visualization of navigation patterns on a Web site using model-based clustering. KDD 2000: 280-284 - Juan Pedro Caraça-Valente, Ignacio Lopez-Chavarrias:
Discovering similar patterns in time series. KDD 2000: 497-505 - Jason Catlett:
Among those dark electronic mills: privacy and data mining (invited talk, abstract only). KDD 2000: 4 - Fei Chen, Diane Lambert, José C. Pinheiro:
Incremental quantile estimation for massive tracking. KDD 2000: 516-522 - Paul B. Chou, Edna Grossman, Dimitrios Gunopulos, Pasumarti Kamesam:
Identifying prospective customers. KDD 2000: 447-456 - William W. Cohen, Henry A. Kautz, David A. McAllester:
Hardening soft information sources. KDD 2000: 255-259 - Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers:
Hancock: a language for extracting signatures from data streams. KDD 2000: 9-17 - Andrew W. Crapo, Laurie B. Waisel, William A. Wallace, Thomas R. Willemain:
Visualization and the process of modeling: a cognitive-theoretic view. KDD 2000: 218-226 - Matt Cutler:
E-metrics: tomorrow's business metrics today (invited talk, abstract only). KDD 2000: 6 - Dennis DeCoste, Kiri Wagstaff:
Alpha seeding for support vector machines. KDD 2000: 345-349 - Anjali Dhond, Amar Gupta, Sanjeev Vadhavkar:
Data mining techniques for optimizing inventories for electronic commerce. KDD 2000: 480-486 - Pedro M. Domingos, Geoff Hulten:
Mining high-speed data streams. KDD 2000: 71-80 - Chris Drummond, Robert C. Holte:
Explicitly representing expected cost: an alternative to ROC representation. KDD 2000: 198-207 - Jennifer G. Dy, Carla E. Brodley:
Visualization and interactive feature selection for unsupervised data. KDD 2000: 360-364 - Ayman Farahat:
Hybrid Poisson process. KDD 2000: 474-479 - Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Yonatan Schler, Jonathan Stoppi:
A framework for specifying explicit bias for revision of approximate information extraction rules. KDD 2000: 189-197 - Gary William Flake, Steve Lawrence, C. Lee Giles:
Efficient identification of Web communities. KDD 2000: 150-160 - Tony Fountain, Thomas G. Dietterich, Bill Sudyka:
Mining IC test data to optimize VLSI testing. KDD 2000: 18-25 - Glenn Fung, Olvi L. Mangasarian:
Data selection for support vector machine classifiers. KDD 2000: 64-70
skipping 50 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-06-06 03: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