• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдено 5 публикаций
Сортировка:
по названию
по году
Статья
Savchenko A., Savchenko L. V. Lecture Notes in Artificial Intelligence. 2014. Vol. 8536. P. 309-318.
Добавлено: 25 июля 2014
Статья
Kuznetsov S., Babin M. A. Lecture Notes in Artificial Intelligence. 2011. Vol. 6628. P. 42-48.
Добавлено: 6 марта 2012
Статья
Ignatov D. I., Kuznetsov S. Lecture Notes in Artificial Intelligence. 2009. Vol. 5662. P. 185-200.

A vast amount of documents in the Web have duplicates, which is a challenge for developing efficient methods that would compute clusters of similar documents. In this paper we use an approach based on computing (closed) sets of attributes having large support (large extent) as clusters of similar documents. The method is tested in a series of computer experiments on large public collections of web documents and compared to other established methods and software, such as biclustering, on same datasets. Practical efficiency of different algorithms for computing frequent closed sets of attributes is compared.

Добавлено: 25 января 2013
Статья
Savchenko A., Savchenko L. V. Lecture Notes in Artificial Intelligence. 2013. Vol. 7911. P. 176-183.

The definition of a phoneme as a fuzzy set of minimal speech units from the model database is proposed. On the basis of this definition and the Kullback-Leibler minimum information discrimination principle the novel phoneme recognition algorithm has been developed as an enhancement of the phonetic decoding method. The experimental results in the problems of isolated vowels recognition and word recognition in Russian are presented. It is shown that the proposed method is characterized by the increase of recognition accuracy and reliability in comparison with the phonetic decoding method

Добавлено: 16 июня 2013
Статья
Savchenko A. Lecture Notes in Artificial Intelligence. 2012. Vol. 7477 LNCS. P. 93-103.

Since the works by Specht, the probabilistic neural networks (PNNs) have attracted researchers due to their ability to increase training speed and their equivalence to the optimal Bayesian decision of classification task. However, it is known that the PNN's conventional implementation is not optimal in statistical recognition of a set of patterns. In this article we present the novel modification of the PNN and prove that it is optimal in this task with general assumptions of the Bayes classifier. The modification is based on a reduction of recognition task to homogeneity testing problem. In the experiment we examine a problem of authorship attribution of Russian texts. Our results support the statement that the proposed network provides better accuracy and is much more resistant to change the smoothing parameter of Gaussian kernel function in comparison with the original PNN.

Добавлено: 26 февраля 2013