Остановите войну!
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 57 matches
- 2012
- Shuang An, Qinghua Hu:
Fuzzy Rough Decision Trees. RSCTC 2012: 397-404 - Jerzy Blaszczynski, Roman Slowinski, Marcin Szelag:
Induction of Ordinal Classification Rules from Incomplete Data. RSCTC 2012: 56-65 - Chien-Chung Chan:
Maximal Characteristic Sets and Neighborhoods Approach to Incomplete Information Systems. RSCTC 2012: 73-82 - Long Chen, Banglan Liu, Wei Song:
An Efficient Data Integrity Verification Method Supporting Multi-granular Operation with Commutative Hash. RSCTC 2012: 132-141 - Weiwei Cheng, Krzysztof Dembczynski, Eyke Hüllermeier, Adrian Jaroszewicz, Willem Waegeman:
F-Measure Maximization in Topical Classification. RSCTC 2012: 439-446 - Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
On Cost and Uncertainty of Decision Trees. RSCTC 2012: 190-197 - Igor Chikalov, Shahid Hussain, Mikhail Moshkov:
Relationships between Number of Nodes and Number of Misclassifications for Decision Trees. RSCTC 2012: 212-218 - Patrick G. Clark, Jerzy W. Grzymala-Busse, Zdzislaw S. Hippe:
How Good Are Probabilistic Approximations for Rule Induction from Data with Missing Attribute Values? RSCTC 2012: 46-55 - Vincent Claveau:
IRISA Participation in JRS 2012 Data-Mining Challenge: Lazy-Learning with Vectorization. RSCTC 2012: 447-454 - Alexander D'yakonov:
A Blending of Simple Algorithms for Topical Classification. RSCTC 2012: 432-438 - Bo Huang, Yan Yang, Amjad Mahmood, Hongjun Wang:
Microblog Topic Detection Based on LDA Model and Single-Pass Clustering. RSCTC 2012: 166-171 - Andrzej Janusz, Hung Son Nguyen, Dominik Slezak, Sebastian Stawicki, Adam Krasuski:
JRS'2012 Data Mining Competition: Topical Classification of Biomedical Research Papers. RSCTC 2012: 422-431 - Andrzej Janusz, Wojciech Swieboda, Adam Krasuski, Hung Son Nguyen:
Interactive Document Indexing Method Based on Explicit Semantic Analysis. RSCTC 2012: 156-165 - Xiuyi Jia, Kan Zheng, Weiwei Li, Tingting Liu, Lin Shang:
Three-Way Decisions Solution to Filter Spam Email: An Empirical Study. RSCTC 2012: 287-296 - Ryan Kiros, Axel J. Soto, Evangelos E. Milios, Vlado Keselj:
Representation Learning for Sparse, High Dimensional Multi-label Classification. RSCTC 2012: 463-470 - Marzena Kryszkiewicz:
The Triangle Inequality versus Projection onto a Dimension in Determining Cosine Similarity Neighborhoods of Non-negative Vectors. RSCTC 2012: 229-236 - Shaoyong Li, Tianrui Li, Chuan Luo:
A Multi-granulation Model under Dominance-Based Rough Set Approach. RSCTC 2012: 18-25 - Jinhai Li, Changlin Mei, Yuejin Lv, Xiao Zhang:
A Heuristic Knowledge Reduction Algorithm for Real Decision Formal Contexts. RSCTC 2012: 303-312 - Yang Liu, Guohua Bai, Qinglei Zhou, Elisabeth Rakus-Andersson:
Rough Sets Based Inequality Rule Learner for Knowledge Discovery. RSCTC 2012: 100-105 - Bin Liu, Yuefeng Li, Yu-Chu Tian:
Discovering Novel Knowledge Using Granule Mining. RSCTC 2012: 380-387 - Jiabin Liu, Fan Min, Shujiao Liao, William Zhu:
Minimal Test Cost Feature Selection with Positive Region Constraint. RSCTC 2012: 259-266 - Wei Liu, Jianjun Qi, Bing Liang:
XDCKS: A RCP-Based Prototype for Formal Concept Analysis. RSCTC 2012: 357-362 - Chuan Luo, Tianrui Li, Hongmei Chen, Dun Liu:
An Incremental Approach for Updating Approximations Based on Set-Valued Ordered Information Systems. RSCTC 2012: 363-369 - Chuanjiang Luo, Guoyin Wang, Feng Hu:
Two-Step Gene Feature Selection Algorithm Based on Permutation Test. RSCTC 2012: 249-258 - Jianmin Ma:
Dependence Space-Based Model for Constructing Dual Concept Lattice in Sub-formal Context. RSCTC 2012: 349-356 - Xi'ao Ma, Guoyin Wang, Hong Yu:
Multiple-Category Attribute Reduct Using Decision-Theoretic Rough Set Model. RSCTC 2012: 267-276 - Vladimir Nikulin:
On the Homogeneous Ensembling with Balanced Random Sets and Boosting. RSCTC 2012: 180-189 - Vladimir Nikulin:
On the Homogeneous Ensembling via Balanced Subsets Combined with Wilcoxon-Based Feature Selection. RSCTC 2012: 455-462 - Agnieszka Nowak-Brzezinska:
Outlier Mining in Rule-Based Knowledge Bases. RSCTC 2012: 206-211 - Agnieszka Nowak-Brzezinska, Tomasz Jach, Alicja Wakulicz-Deja:
Inference Processes Using Incomplete Knowledge in Decision Support Systems - Chosen Aspects. RSCTC 2012: 150-155
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-04-25 15:36 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