Остановите войну!
for scientists:
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 84 matches
- 2004
- Hamad Alhammady, Kotagiri Ramamohanarao:
The Application of Emerging Patterns for Improving the Quality of Rare-Class Classification. PAKDD 2004: 207-211 - Ahmed Amrani, Yves Kodratoff, Oriane Matte-Tailliez:
A Semi-automatic System for Tagging Specialized Corpora. PAKDD 2004: 670-681 - Kwok-Chung Au, Kwok-Wai Cheung:
Learning Hidden Markov Model Topology Based on KL Divergence for Information Extraction. PAKDD 2004: 590-594 - Jun-Peng Bao, Jun-Yi Shen, Xiao-Dong Liu, Haiyan Liu, Xiao-Di Zhang:
Semantic Sequence Kin: A Method of Document Copy Detection. PAKDD 2004: 529-538 - Daniel Barbará, Ping Chen, Zohreh Nazeri:
Self-Similar Mining of Time Association Rules. PAKDD 2004: 86-95 - Jérémy Besson, Céline Robardet, Jean-François Boulicaut:
Constraint-Based Mining of Formal Concepts in Transactional Data. PAKDD 2004: 615-624 - Francesco Bonchi, Bart Goethals:
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees. PAKDD 2004: 155-160 - Remco R. Bouckaert, Eibe Frank:
Evaluating the Replicability of Significance Tests for Comparing Learning Algorithms. PAKDD 2004: 3-12 - Huiping Cao, David W. Cheung, Nikos Mamoulis:
Discovering Partial Periodic Patterns in Discrete Data Sequences. PAKDD 2004: 653-658 - Sharma Chakravarthy, Ramji Beera, Ramanathan Balachandran:
DB-Subdue: Database Approach to Graph Mining. PAKDD 2004: 341-350 - Yi Chen:
Discovering Ordered Tree Patterns from XML Queries. PAKDD 2004: 559-563 - Ling Chen, Sourav S. Bhowmick, Liang-Tien Chia:
Mining Association Rules from Structural Deltas of Historical XML Documents. PAKDD 2004: 452-457 - Jie Chen, Hongxing He, Graham J. Williams, Huidong Jin:
Temporal Sequence Associations for Rare Events. PAKDD 2004: 235-239 - Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz:
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees. PAKDD 2004: 63-73 - Peter Christen, Tim Churches, Markus Hegland:
Febrl - A Parallel Open Source Data Linkage System: http://datamining.anu.edu.au/linkage.html. PAKDD 2004: 638-647 - Fang Chu, Carlo Zaniolo:
Fast and Light Boosting for Adaptive Mining of Data Streams. PAKDD 2004: 282-292 - Tim Churches, Peter Christen:
Blind Data Linkage Using n-gram Similarity Comparisons. PAKDD 2004: 121-126 - Honghua Dai, Gang Li, Zhi-Hua Zhou:
Ensembling MML Causal Discovery. PAKDD 2004: 260-271 - Chris H. Q. Ding, Xiaofeng He:
Cluster Structure of K-means Clustering via Principal Component Analysis. PAKDD 2004: 414-418 - Hongjian Fan, Kotagiri Ramamohanarao:
Noise Tolerant Classification by Chi Emerging Patterns. PAKDD 2004: 201-206 - Usama M. Fayyad:
Data Mining Grand Challenges. PAKDD 2004: 2 - Johannes Fischer, Luc De Raedt:
Towards Optimizing Conjunctive Inductive Queries. PAKDD 2004: 625-637 - Gabriel Pui Cheong Fung, Jeffrey Xu Yu, Hongjun Lu:
Classifying Text Streams in the Presence of Concept Drifts. PAKDD 2004: 373-383 - Shantanu Godbole, Sunita Sarawagi:
Discriminative Methods for Multi-labeled Classification. PAKDD 2004: 22-30 - Gianluigi Greco, Antonella Guzzo, Luigi Pontieri, Domenico Saccà:
Mining Expressive Process Models by Clustering Workflow Traces. PAKDD 2004: 52-62 - Peng Han, Bo Xie, Fan Yang, Ruimin Shen:
A Novel Distributed Collaborative Filtering Algorithm and Its Implementation on P2P Overlay Network. PAKDD 2004: 106-115 - Xiaoshu Hang, Honghua Dai:
An Extended Negative Selection Algorithm for Anomaly Detection. PAKDD 2004: 245-254 - Chih-Ming Hsu, Ming-Syan Chen:
Subspace Clustering of High Dimensional Spatial Data with Noises. PAKDD 2004: 31-40 - I-Ane Huang, Jan-Ming Ho, Hung-Yu Kao, Shian-Hua Lin:
Extracting Citation Metadata from Online Publication Lists Using BLAST. PAKDD 2004: 539-548 - Qiming Huang, Qiang Yang, Joshua Zhexue Huang, Michael K. Ng:
Mining of Web-Page Visiting Patterns with Continuous-Time Markov Models. PAKDD 2004: 549-558
skipping 54 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-07-18 07:46 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