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 102 matches
- 2006
- Hidenao Abe, Shusaku Tsumoto, Miho Ohsaki, Takahira Yamaguchi:
Evaluating a Rule Evaluation Support Method Based on Objective Rule Evaluation Indices. PAKDD 2006: 509-519 - Hidenao Abe, Takahira Yamaguchi:
Constructive Meta-level Feature Selection Method Based on Method Repositories. PAKDD 2006: 70-80 - Elke Achtert, Christian Böhm, Peer Kröger:
DeLi-Clu: Boosting Robustness, Completeness, Usability, and Efficiency of Hierarchical Clustering by a Closest Pair Ranking. PAKDD 2006: 119-128 - Elke Achtert, Hans-Peter Kriegel, Alexey Pryakhin, Matthias Schubert:
Clustering Multi-represented Objects Using Combination Trees. PAKDD 2006: 174-178 - Preetha Appan, Hari Sundaram, Belle L. Tseng:
Summarization and Visualization of Communication Patterns in a Large-Scale Social Network. PAKDD 2006: 371-379 - A. Majid Awan, Mohd. Noor Md. Sap:
An Intelligent System Based on Kernel Methods for Crop Yield Prediction. PAKDD 2006: 841-846 - Ramanathan Balachandran, Srihari Padmanabhan, Sharma Chakravarthy:
Enhanced DB-Subdue: Supporting Subtle Aspects of Graph Mining Using a Relational Approach. PAKDD 2006: 673-678 - Shariq Bashir, Abdul Rauf Baig:
Ramp: High Performance Frequent Itemset Mining with Efficient Bit-Vector Projection Technique. PAKDD 2006: 504-508 - Laure Berti-Équille:
Quality-Aware Association Rule Mining. PAKDD 2006: 440-449 - Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfeifle:
Parallel Density-Based Clustering of Complex Objects. PAKDD 2006: 179-188 - Longbing Cao, Chengqi Zhang:
Domain-Driven Actionable Knowledge Discovery in the Real World. PAKDD 2006: 821-830 - Michael Chau, Reynold Cheng, Ben Kao, Jackey Ng:
Uncertain Data Mining: An Example in Clustering Location Data. PAKDD 2006: 199-204 - Ling Chen, Sourav S. Bhowmick, Jinyan Li:
Mining Temporal Indirect Associations. PAKDD 2006: 425-434 - Wei-Ta Chen, Yi-Ling Chen, Ming-Syan Chen:
Mining Frequent Spatial Patterns in Image Databases. PAKDD 2006: 699-703 - James Cheng, Yiping Ke, Wilfred Ng:
Maintaining Frequent Itemsets over High-Speed Data Streams. PAKDD 2006: 462-467 - Haibin Cheng, Pang-Ning Tan, Jing Gao, Jerry Scripps:
Multistep-Ahead Time Series Prediction. PAKDD 2006: 765-774 - Kurt Driessens, Peter Reutemann, Bernhard Pfahringer, Claire Leschi:
Using Weighted Nearest Neighbor to Benefit from Unlabeled Data. PAKDD 2006: 60-69 - Hongjian Fan, Ming Fan, Kotagiri Ramamohanarao, Mengxu Liu:
Further Improving Emerging Pattern Based Classifiers Via Bagging. PAKDD 2006: 91-96 - Hongqin Fan, Osmar R. Zaïane, Andrew Foss, Junfeng Wu:
A Nonparametric Outlier Detection for Effectively Discovering Top-N Outliers from Engineering Data. PAKDD 2006: 557-566 - Guang Feng, Tie-Yan Liu, Xudong Zhang, Wei-Ying Ma:
Level-Biased Statistics in the Hierarchical Structure of the Web. PAKDD 2006: 313-322 - Eibe Frank, Bernhard Pfahringer:
Improving on Bagging with Input Smearing. PAKDD 2006: 97-106 - John Galloway, Simeon J. Simoff:
Network Data Mining: Discovering Patterns of Interaction Between Attributes. PAKDD 2006: 410-414 - John Goh, David Taniar, Ee-Peng Lim:
SGPM: Static Group Pattern Mining Using Apriori-Like Sliding Window. PAKDD 2006: 415-424 - David J. Hand:
Protection or Privacy? Data Mining and Personal Data. PAKDD 2006: 1-10 - Zengyou He, Shengchun Deng, Xiaofei Xu, Joshua Zhexue Huang:
A Fast Greedy Algorithm for Outlier Mining. PAKDD 2006: 567-576 - Yu Hirate, Hayato Yamana:
Sequential Pattern Mining with Time Intervals. PAKDD 2006: 775-779 - Shinn-Ying Ho, Chih-Hung Hsieh, Kuan-Wei Chen, Hui-Ling Huang, Hung-Ming Chen, Shinn-Jang Ho:
Scoring Method for Tumor Prediction from Microarray Data Using an Evolutionary Fuzzy Classifier. PAKDD 2006: 520-529 - Shinn-Jang Ho, Wen-Yuan Ku, Jun-Wun Jou, Ming-Hao Hung, Shinn-Ying Ho:
Intelligent Particle Swarm Optimization in Multi-objective Problems. PAKDD 2006: 790-800 - Chen-Ming Hsu, Chien-Yu Chen, Ching-Chi Hsu, Baw-Jhiune Liu:
Efficient Discovery of Structural Motifs from Protein Sequences with Combination of Flexible Intra- and Inter-block Gap Constraints. PAKDD 2006: 530-539 - Yaochun Huang, Hui Xiong, Weili Wu, Sam Yuan Sung:
Mining Quantitative Maximal Hyperclique Patterns: A Summary of Results. PAKDD 2006: 552-556
skipping 72 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-18 06:27 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