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 110 matches
- 2001
- Charu C. Aggarwal, Philip S. Yu:
On Effective Conceptual Indexing and Similarity Search in Text Data. ICDM 2001: 3-10 - Fernando Alonso, Juan Pedro Caraça-Valente, Loïc Martínez, César Montes:
Discovering Similar Patterns for Characterising Time Series in a Medical Domain. ICDM 2001: 577-579 - Aijun An, Yuanyuan Wang:
Comparisons of Classification Methods for Screening Potential Compounds. ICDM 2001: 11-18 - Michael Anderson:
Knowledge Discovery from Diagrammatically Represented Data. ICDM 2001: 19-26 - Suhail Ansari, Ron Kohavi, Llew Mason, Zijian Zheng:
Integrating E-Commerce and Data Mining: Architecture and Challenges. ICDM 2001: 27-34 - Wai-Ho Au, Keith C. C. Chan:
Classification with Degree of Membership: A Fuzzy Approach. ICDM 2001: 35-42 - José L. Balcázar, Yang Dai, Osamu Watanabe:
Provably Fast Training Algorithms for Support Vector Machines. ICDM 2001: 43-50 - Krishna Bharat, Bay-Wei Chang, Monika Henzinger, Matthias Ruhl:
Who Links to Whom: Mining Linkage between Web Sites. ICDM 2001: 51-58 - Catherine Blake, Wanda Pratt:
Better Rules, Few Features: A Semantic Approach to Selecting Features from Text. ICDM 2001: 59-66 - Richard J. Bolton, David J. Hand:
Significance Tests for Patterns in Continuous Data. ICDM 2001: 67-74 - Nitesh V. Chawla, Steven Eschrich, Lawrence O. Hall:
Creating Ensembles of Classifiers. ICDM 2001: 580-581 - Jie Chen, Haiying Li, Shiwei Tang:
Association Rules Enhanced Classification of Underwater Acoustic Signal. ICDM 2001: 582-583 - Rong Chen, Krishnamoorthy Sivakumar, Hillol Kargupta:
Distributed Web Mining Using Bayesian Networks from Multiple Data Streams. ICDM 2001: 75-82 - Jong-Sheng Cherng, Mei-Jung Lo:
A Hypergraph Based Clustering Algorithm for Spatial Data Sets. ICDM 2001: 83-90 - David Maxwell Chickering, Christopher Meek, Robert Rounthwaite:
Efficient Determination of Dynamic Split Points in a Decision Tree. ICDM 2001: 91-98 - June-Suh Cho, Nabil R. Adam:
Efficient Splitting Rules Based on the Probabilities of Pre-assigned Intervals. ICDM 2001: 584-585 - Viviane Crestana-Jensen, Nandit Soparkar:
Heuristic Optimization for Decentralized Frequent Itemset Counting. ICDM 2001: 613-614 - Honghua Dai, Xiaoshu Hang, Gang Li:
Inexact Field Learning: An Approach to Induce High Quality Rules from Low Quality Data. ICDM 2001: 586-588 - Manoranjan Dash, Kian-Lee Tan, Huan Liu:
Efficient Yet Accurate Clustering. ICDM 2001: 99-106 - Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, Horst D. Simon:
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering. ICDM 2001: 107-114 - Carlotta Domeniconi, Dimitrios Gunopulos:
Incremental Support Vector Machine Construction. ICDM 2001: 589-592 - Tapio Elomaa, Juho Rousu:
Preprocessing Opportunities in Optimal Numerical Range Partitioning. ICDM 2001: 115-122 - Wei Fan, Matthew Miller, Salvatore J. Stolfo, Wenke Lee, Philip K. Chan:
Using Artificial Anomalies to Detect Unknown and Known Network Intrusions. ICDM 2001: 123-130 - Tom Fawcett:
Using Rule Sets to Maximize ROC Performance. ICDM 2001: 131-138 - Hichem Frigui, Mohamed Ben Hadj Rhouma:
A Synchronization Based Algorithm for Discovering Ellipsoidal Clusters in Large Datasets. ICDM 2001: 139-146 - João Gama:
Functional Trees for Classification. ICDM 2001: 147-154 - Wolfgang Gaul, Lars Schmidt-Thieme:
Mining Generalized Association Rules for Sequential and Path Data. ICDM 2001: 593-596 - Floris Geerts, Bart Goethals, Jan Van den Bussche:
A Tight Upper Bound on the Number of Candidate Patterns. ICDM 2001: 155-162 - Rayid Ghani:
Combining Labeled and Unlabeled Data for Text Classification with a Large Number of Categories. ICDM 2001: 597-598 - Daniel Gillblad, Anders Holst:
Dependency Derivation in Industrial Process Data. ICDM 2001: 599-602
skipping 80 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-01-07 00:32 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