Остановите войну!
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 30 matches
- 2001
- Ramesh C. Agarwal, Mahesh V. Joshi:
PNrule: A New Framework for Learning Classifier Models in Data Mining (A Case-Study in Network Intrusion Detection). SDM 2001: 1-17 - Ahmed Ayad, Nagwa M. El-Makky, Yousry I. Taha:
Incremental Mining of Constrained Association Rules. SDM 2001: 1-18 - Daniel Barbará, Ningning Wu, Sushil Jajodia:
Detecting Novel Network Intrusions Using Bayes Estimators. SDM 2001: 1-17 - Donald E. Brown, Hua Liu, Yifei Xue:
Mining Preferences from Spatial-Temporal Data. SDM 2001: 1-17 - Michael C. Burl, Shawn M. Briglin, Brett J. Doleman, Alan Hopkins, A. Matzger, D. N. Ortiz, A. Schaffer, S. Upchurch, Thomas P. Vaid, Nathan S. Lewis:
Mining the Detector Responses of a Conducting Polymer Composite-Based Electronic Nose. SDM 2001: 1-15 - Sanjay Chawla, Shashi Shekhar, Weili Wu, Uygar Özesmi:
Modeling Spatial Dependencies for Mining Geospatial Data. SDM 2001: 1-17 - Shu Chen, Bing Liu:
Generating Classification Rules According to User's Existing Knowledge. SDM 2001: 1-15 - Mukund Deshpande, George Karypis:
Selective Markov Models for Predicting Web-Page Accesses. SDM 2001: 1-15 - Ben Gum, Richard J. Lipton:
Cheaper by the Dozen: Batched Algorithms. SDM 2001: 1-11 - Gunjan Gupta, Joydeep Ghosh:
Detecting Seasonal Trends and Cluster Motion Visualization for Very High Dimensional Transactional Data. SDM 2001: 1-17 - Tor-Kristian Jenssen, Lisa M. J. Öberg, Magnus L. Andersson, Jan Komorowski:
Methods for Large-Scale Mining of Networks of Human Genes. SDM 2001: 1-16 - Moongu Jeon, Haesun Park, J. Ben Rosen:
Dimension reduction based on centroids and least squares for efficient processing of text data. SDM 2001: 1-13 - Ruoming Jin, Gagan Agrawal:
A Middleware for Developing Parallel Data Mining Applications. SDM 2001: 1-18 - Eamonn J. Keogh, Michael J. Pazzani:
Derivative Dynamic Time Warping. SDM 2001: 1-11 - Kwok-Yin Lai, Wai Lam:
Automatic Textual Document Categorization Using Multiple Similarity-Based Models. SDM 2001: 1-16 - Aleksandar Lazarevic, Zoran Obradovic:
Boosting Localized Classifiers in Heterogeneous Databases. SDM 2001: 1-16 - Yuh-Jye Lee, Olvi L. Mangasarian:
RSVM: Reduced Support Vector Machines. SDM 2001: 1-17 - Heikki Mannila, Dmitry Rusakov:
Decomposition of Event Sequences into Independent Components. SDM 2001: 1-17 - Heikki Mannila, Jouni K. Seppänen:
Finding similar situations in sequences of events via random projections. SDM 2001: 1-16 - Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary:
Adaptive Grids for Clustering Massive Data Sets. SDM 2001: 1-17 - Ramesh Natarajan, Edwin P. D. Pednault:
Using Simulated Pseudo Data To Speed Up Statistical Predictive Modeling From Massive Data Sets. SDM 2001: 1-14 - Byung-Hoon Park, Rajeev Ayyagari, Hillol Kargupta:
A Fourier Analysis Based Approach to Learning Decision Trees in a Distributed Environment. SDM 2001: 1-22 - Srinivasan Parthasarathy, Sandhya Dwarkadas:
Shared State for Client-Server Mining. SDM 2001: 1-20 - Dragoljub Pokrajac, Zoran Obradovic:
Improved Spatial-Temporal Forecasting through Modelling of Spatial Residuals in Recent History. SDM 2001: 1-17 - Sergio M. Savaresi, Daniel Boley:
On the performance of bisecting K-means and PDDP. SDM 2001: 1-14 - Vikas Sindhwani, P. Bhattacharya, Subrata Rakshit:
Information Theoretic Feature Crediting in Multiclass Support Vector Machines. SDM 2001: 1-18 - Claudio Tebaldi, Doug Nychka, Grant Branstator:
Looking for Nonlinearities in the Large Scale Dynamics of the Atmosphere. SDM 2001: 1-15 - Ke Wang, Senqiang Zhou, Yu He:
Hierarchical Classification of Real Life Documents. SDM 2001: 1-16 - Bin Zhang:
Generalized K-Harmonic Means - Dynamic Weighting of Data in Unsupervised Learning. SDM 2001: 1-13 - Vipin Kumar, Robert L. Grossman:
Proceedings of the First SIAM International Conference on Data Mining, SDM 2001, Chicago, IL, USA, April 5-7, 2001. SIAM 2001, ISBN 978-0-89871-495-1 [contents]
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 01:30 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