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 57 matches
- 2002
- Jafar Adibi, Wei-Min Shen, Eaman Noorbakhsh:
Self-Similarity for Data Mining and Predictive Modeling - A Case Study for Network Data. PAKDD 2002: 210-217 - Ki Chan, Boon Toh Low, Wai Lam, Kai-Pui Lam:
Extracting Causation Knowledge from Natural Language Texts. PAKDD 2002: 555-560 - Ye-In Chang, Yu-Ming Hsieh:
SETM*-MaxK: An Efficient SET-Based Approach to Find the Largest Itemset. PAKDD 2002: 316-321 - Chia-Hui Chang, Shih-Chien Kuo, Kuo-Yu Huang, Tsung-Hsin Ho, Chih-Lung Lin:
Automatic Information Extraction for Multiple Singular Web Pages. PAKDD 2002: 297-303 - Zhixiang Chen, Ada Wai-Chee Fu, Frank Chi-Hung Tong:
Optimal Algorithms for Finding User Access Sessions from Very Large Web Logs. PAKDD 2002: 290-296 - Chien-Yu Chen, Shien-Ching Hwang, Yen-Jen Oyang:
An Incremental Hierarchical Data Clustering Algorithm Based on Gravity Theory. PAKDD 2002: 237-250 - Felix Cheung, Ben Kao, David Wai-Lok Cheung, Chi-Yuen Ng:
An Efficient Algorithm for Incremental Update of Concept Spaces. PAKDD 2002: 368-380 - Lee-Feng Chien, Chien-Kang Huang, Hsin-Chen Chiao, Shih-Jui Lin:
Incremental Extraction of Keyterms for Classifying Multilingual Documents in the Web. PAKDD 2002: 506-516 - Honghua Dai, Gang Li:
An Improved Approach for the Discovery of Causal Models via MML. PAKDD 2002: 304-315 - Mukund Deshpande, George Karypis:
Evaluation of Techniques for Classifying Biological Sequences. PAKDD 2002: 417-431 - Lili Diao, Keyun Hu, Yuchang Lu, Chunyi Shi:
A Method to Boost Naïve Bayesian Classifiers. PAKDD 2002: 115-122 - Lili Diao, Keyun Hu, Yuchang Lu, Chunyi Shi:
A Method to Boost Support Vector Machines. PAKDD 2002: 463-468 - Qin Ding, Qiang Ding, William Perrizo:
Association Rule Mining on Remotely Sensed Images Using P-trees. PAKDD 2002: 66-79 - Hongjian Fan, Kotagiri Ramamohanarao:
An Efficient Single-Scan Algorithm for Mining Essential Jumping Emerging Patterns for Classification. PAKDD 2002: 456-462 - Yoshikazu Fujikawa, Tu Bao Ho:
Cluster-Based Algorithms for Dealing with Missing Values. PAKDD 2002: 549-554 - Gabriel Pui Cheong Fung, Jeffrey Xu Yu, Wai Lam:
News Sensitive Stock Trend Prediction. PAKDD 2002: 481-493 - Kazuyoshi Furukawa, Tomoyuki Uchida, Kazuya Yamada, Tetsuhiro Miyahara, Takayoshi Shoudai, Yasuaki Nakamura:
Extracting Characteristic Structures among Words in Semistructured Documents. PAKDD 2002: 356-367 - Minos N. Garofalakis, Rajeev Rastogi:
Network Data Mining and Analysis: The NEMESIS Project. PAKDD 2002: 1-12 - Sylvie Guillaume:
Discovery of Ordinal Association Rules. PAKDD 2002: 322-327 - Jianchao Han, Nick Cercone:
Interactive Construction of Classification Rules. PAKDD 2002: 529-534 - Robert J. Hilderman:
The Lorenz Dominance Order as a Measure of Interestingness in KDD. PAKDD 2002: 177-185 - Jochen Hipp, Christoph Mangold, Ulrich Güntzer, Gholamreza Nakhaeizadeh:
Efficient Rule Retrieval and Postponed Restrict Operations for Association Rule Mining. PAKDD 2002: 52-65 - William W. Hsu, Ching-Chi Hsu:
GEC: An Evolutionary Approach for Evolving Classifiers. PAKDD 2002: 450-455 - Szymon Jaroszewicz, Dan A. Simovici:
Pruning Redundant Association Rules Using Maximum Entropy Principle. PAKDD 2002: 135-147 - Xiaoming Jin, Yuchang Lu, Chunyi Shi:
Distribution Discovery: Local Analysis of Temporal Rules. PAKDD 2002: 469-480 - François-Xavier Jollois, Mohamed Nadif:
Clustering Large Categorical Data. PAKDD 2002: 257-263 - Maleq Khan, Qin Ding, William Perrizo:
k-nearest Neighbor Classification on Spatial Data Streams Using P-trees. PAKDD 2002: 517-518 - Marzena Kryszkiewicz, Marcin Gajek:
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators. PAKDD 2002: 159-171 - Cuiping Li, Sheng-En Li, Shan Wang, Xiaoyong Du:
Efficient Constraint-Based Exploratory Mining on Large Data Cubes. PAKDD 2002: 381-392 - Yulan Liang, King-Ip Lin, Arpad Kelemen:
Adaptive Generalized Estimation Equation with Bayes Classifier for the Job Assignment Problem. PAKDD 2002: 438-449
skipping 27 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-11-02 17:45 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