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 53 matches
- 2000
- Jean-François Boulicaut, Artur Bykowski:
Frequent Closures as a Concise Representation for Binary Data Mining. PAKDD 2000: 62-73 - K. Selçuk Candan, Wen-Syan Li:
Using Random Walks for Mining Web Document Associations. PAKDD 2000: 294-305 - David Wai-Lok Cheung, Lian Wang, Siu-Ming Yiu, Bo Zhou:
Density-Based Mining of Quantitative Association Rules. PAKDD 2000: 257-268 - Wesley T. Chuang, Jihoon Yang:
Text Summarization by Sentence Segment Extraction Using Machine Learning Algorithms. PAKDD 2000: 454-457 - Manoranjan Dash, Huan Liu:
Feature Selection for Clustering. PAKDD 2000: 110-121 - Manoranjan Dash, Huan Liu, Hiroshi Motoda:
Consistency Based Feature Selection. PAKDD 2000: 98-109 - Yanlei Diao, Hongjun Lu, Dekai Wu:
A Comparative Study of Classification Based Personal E-mail Filtering. PAKDD 2000: 408-419 - Carlos Domingo, Osamu Watanabe:
Scaling Up a Boosting-Based Learner via Adaptive Sampling. PAKDD 2000: 317-328 - Ryoichi Fujino, Hiroki Arimura, Setsuo Arikawa:
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. PAKDD 2000: 281-293 - Shlomo Geva, Lawrence Buckingham:
VQTree: Vector Quantization for Decision Tree Induction. PAKDD 2000: 349-359 - Fosca Giannotti, Giuseppe Manco:
Making Knowledge Extraction and Reasoning Closer. PAKDD 2000: 360-371 - Jianchao Han, Nick Cercone:
AViz: A Visualization System for Discovering Numeric Association Rules. PAKDD 2000: 269-280 - Seiji Hotta, Kohei Inoue, Kiichi Urahama:
Extraction of Fuzzy Clusters from Weighted Graphs. PAKDD 2000: 442-453 - Zhexue Huang, Tao Lin:
A Visual Method of Cluster Validation with Fastmap. PAKDD 2000: 153-164 - Edward Hung, David Wai-Lok Cheung, Ben Kao, Yilong Liang:
An Optimization Problem in Data Cube System Design. PAKDD 2000: 74-85 - Farhad Hussain, Huan Liu, Einoshin Suzuki, Hongjun Lu:
Exception Rule Mining with a Relative Interestingness Measure. PAKDD 2000: 86-97 - Hirotaka Inoue, Hiroyuki Narihisa:
Improving Generalization Ability of Self-Generating Neural Networks Through Ensemble Averaging. PAKDD 2000: 177-180 - Takashi Ishikawa, Masayuki Numao, Takao Terano:
Discovering Protein Functional Models Using Inductive Logic Programming. PAKDD 2000: 212-215 - Viviane Crestana-Jensen, Nandit Soparkar:
Frequent Itemset Counting Across Multiple Tables. PAKDD 2000: 49-61 - Eamonn J. Keogh, Michael J. Pazzani:
A Simple Dimensionality Reduction Technique for Fast Similarity Search in Large Time Series Databases. PAKDD 2000: 122-133 - Chi-Kin Keung, Wai Lam:
Prototype Generation Based on Instance Filtering and Averaging. PAKDD 2000: 142-152 - Aleksandar Lazarevic, Tim Fiez, Zoran Obradovic:
Adaptive Boosting for Spatial Functions with Unstable Driving Attributes. PAKDD 2000: 329-340 - K. C. Lee, J. S. Park, Y. S. Kim, Yung-Tai Byun:
Missing Value Estimation Based on Dynamic Attribute Selection. PAKDD 2000: 134-137 - Jinyan Li, Guozhu Dong, Kotagiri Ramamohanarao:
Making Use of the Most Expressive Jumping Emerging Patterns for Classification. PAKDD 2000: 220-232 - Tsau Young Lin, Joseph Tremba:
Attribute Transformations on Numerical Databases. Applications to Stock Market and Economic Data. PAKDD 2000: 181-192 - Takashi Matsuda, Tadashi Horiuchi, Hiroshi Motoda, Takashi Washio:
Extension of Graph-Based Induction for General Graph Structured Data. PAKDD 2000: 420-431 - Hirofumi Matsuzawa, Takeshi Fukuda:
Mining Structured Association Patterns from Databases. PAKDD 2000: 233-244 - Dieter Merkl, Andreas Rauber:
Uncovering the Hierarchical Structure of Text Archives by Using an Unsupervised Neural Network with Adaptive Architecture. PAKDD 2000: 384-395 - Ryszard S. Michalski:
Inductive Databases and Knowledge Scouts. PAKDD 2000: 2-3 - Tetsuhiro Miyahara, Takayoshi Shoudai, Tomoyuki Uchida, Kenichi Takahashi, Hiroaki Ueda:
Polynomial Time Matching Algorithms for Tree-Like Structured Patterns in Knowledge Discovery. PAKDD 2000: 5-16
skipping 23 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-10-08 22:54 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