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 122 matches
- 2002
- Naoki Abe, Edwin P. D. Pednault, Haixun Wang, Bianca Zadrozny, Wei Fan, Chidanand Apté:
Empirical Comparison of Various Reinforcement Learning Strategies for Sequential Targeted Marketing. ICDM 2002: 3-10 - Tamas Abraham, Olivier Y. de Vel:
Investigative Profiling with Computer Forensic Log Data and Association Rules. ICDM 2002: 11-18 - Maria-Luiza Antonie, Osmar R. Zaïane:
Text Document Categorization by Term Association. ICDM 2002: 19-26 - Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Kawasoe, Setsuo Arikawa:
Online Algorithms for Mining Semi-structured Data Stream. ICDM 2002: 27-34 - Elena Baralis, Paolo Garza:
A Lazy Approach to Pruning Classification Rules. ICDM 2002: 35-42 - Michael R. Berthold, Bernd Wiswedel, David E. Patterson:
Neighborgram Clustering Interactive Exploration of Cluster Neighborhoods. ICDM 2002: 581-584 - Christian Böhm, Florian Krebs:
High Performance Data Mining Using the Nearest Neighbor Join. ICDM 2002: 43-50 - Christian Borgelt, Michael R. Berthold:
Mining Molecular Fragments: Finding Relevant Substructures of Molecules. ICDM 2002: 51-58 - Stefano Cazzella, Luigi Dragone, Stefano Trisolini:
Telecommunications Strategic Marketing - KDD and Economic Modeling. ICDM 2002: 751-754 - Cheng-Yue Chang, Ming-Syan Chen, Chang-Hung Lee:
Mining General Temporal Association Rules for Items with Different Exhibition Periods. ICDM 2002: 59-66 - Rong Chen, Krishnamoorthy Sivakumar:
A New Algorithm for Learning Parameters of a Bayesian Network from Distributed Data. ICDM 2002: 585-588 - Yisong Chen, Guoping Wang, Shihai Dong:
Learning with Progressive Transductive Support Vector Machine. ICDM 2002: 67-74 - Shui-Lung Chuang, Lee-Feng Chien:
Towards Automatic Generation of Query Taxonomy: A Hierarchical Query Clustering Approach. ICDM 2002: 75-82 - Korris Fu-Lai Chung, Tak-Chung Fu, Robert W. P. Luk, Vincent Ng:
Evolutionary Time Series Segmentation for Stock Data Mining. ICDM 2002: 83-90 - Denis Clot:
Using functional PCA for cardiac motion exploration. ICDM 2002: 91-98 - Paul R. Cohen, Brent Heeringa, Niall M. Adams:
Unsupervised Segmentation of Categorical Time Series into Episodes. ICDM 2002: 99-106 - Gao Cong, Bing Liu:
Speed-up Iterative Frequent Itemset Mining with Constraint Changes. ICDM 2002: 107-114 - Emilio Corchado, Colin Fyfe:
Optimal Projections of High Dimensional Data. ICDM 2002: 589-596 - Laurentiu Cristofor, Dan A. Simovici:
Generating an informative cover for association rules. ICDM 2002: 597-600 - Manoranjan Dash, Kiseok Choi, Peter Scheuermann, Huan Liu:
Feature Selection for Clustering - A Filter Solution. ICDM 2002: 115-122 - Hasan Davulcu, Saikat Mukherjee, I. V. Ramakrishnan:
Extraction Techniques for Mining Services from Web Sources. ICDM 2002: 601-604 - Ayhan Demiriz:
webSPADE: A Parallel Sequence Mining Algorithm to Analyze Web Log Data. ICDM 2002: 755-758 - Inderjit S. Dhillon, Yuqiang Guan, Jacob Kogan:
Iterative Clustering of High Dimensional Text Data Augmented by Local Search. ICDM 2002: 131-138 - Chris H. Q. Ding, Xiaofeng He:
Cluster merging and splitting in hierarchical clustering algorithms. ICDM 2002: 139-146 - Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst D. Simon:
Adaptive dimension reduction for clustering high dimensional data. ICDM 2002: 147-154 - Ivo Düntsch, Günther Gediga:
Modal-style operators in qualitative data analysis. ICDM 2002: 155-162 - Wei Fan, Haixun Wang, Philip S. Yu, Shaw-Hwa Lo, Salvatore J. Stolfo:
Progressive Modeling. ICDM 2002: 163-170 - John A. Flanagan, Jani Mäntyjärvi, Johan Himberg:
Unsupervised Clustering of Symbol Strings and Context Recognition. ICDM 2002: 171-178 - Simon Fong, Serena Chan:
Mining Online Users? Access Records for Web Business Intelligence. ICDM 2002: 759-762 - Andrew Foss, Osmar R. Zaïane:
A Parameterless Method for Efficiently Discovering Clusters of Arbitrary Shape in Large Datasets. ICDM 2002: 179-186
skipping 92 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-12-30 06:34 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