Titlebook: Artificial Intelligence and Soft Computing; 11th International C Leszek Rutkowski,Marcin Korytkowski,Jacek M. Zurad Conference proceedings

联邦

CLAIM

Fast Plagiarism Detection by Sentence Hashingpecial trait of the written texts - their natural sentence fragmentation, later employing a set of special techniques for text representation. Results obtained demonstrate that the algorithm delivers solution faster than the alternatives. Its algorithmic complexity is logarithmic, thus its performan

abreast

样式

On the Structure of Indiscernibility Relations Compatible with a Partially Ordered Set, he introduces a notion of compatibility between the (partially ordered) universe and an indiscernibility relation on its support, and establishes a criterion for compatibility. In this paper we make a first step in the direction of investigating the structure of all the indiscernibility relations

DOLT

不满分子

壮丽的去

Mining of Multiobjective Non-redundant Association Rules in Data Streamsddressed both the issues for data streams. Further, association rule mining is now considered as multiobjective problem where multiple measures like correlation coefficient, recall, comprehensibility, lift etc can be used for evaluating a rule. Discovery of multiobjective association rules in data s

连锁

corpuscle

On Resources Optimization in Fuzzy Clustering of Data Streamsms are examined. It is shown that partitioning a data stream into chunks reduces the processing time of considered algorithms significantly. The partitioning procedure is accompanied with the reduction of results accuracy, however the change is acceptable. The problems arised due to the high speed d

CLOT

A Comparison of Complexity Selection Approaches for Polynomials Based on: Vapnik-Chervonenkis Dimense recent ideas of Rademacher complexity and covering numbers. The classification task that we consider is carried out by polynomials. Additionally, we compare results of non-regularized and ..-regularized learning and its influence on complexity.