Просмотреть запись

Narrow-domain Short Texts Clustering Algorithm

Электронный научный архив УРФУ

Информация об архиве | Просмотр оригинала
 
 
Поле Значение
 
Заглавие Narrow-domain Short Texts Clustering Algorithm
 
Автор Popova, S. V.
Khodyrev, I. A.
 
Тематика INFORMATION RETRIEVAL
TEXTS CLUSTERING
NARROW-DOMAIN SHORT TEXTS CLUSTERING
K-MEANS
GENETIC ALGORITHM
 
Описание In this paper, we describe the algorithm of narrow-domain short texts clustering, which is based on terms’ selection and modification of k-means algorithm. Our approach was tested on collections: CICling–2002 and SEPLIN-CICling. Results of tests and conclusions are presented.
 
Дата 2011-10-12T09:50:17Z
2011-10-12T09:50:17Z
2011
 
Тип Article
Journal article (info:eu-repo/semantics/article)
Published version (info:eu-repo/semantics/publishedVersion)
 
Идентификатор Popova S. V. Narrow-domain Short Texts Clustering Algorithm / S. V. Popova, I. A. Khodyrev // Web of Data: The joint RuSSIR/EDBT 2011 Summer School, August 15–19, 2011, Proceedings of the Fifth Russian Young Scientists Conference in Information Retrieval / B. Novikov, P. Braslavsky (Eds.). — St. Petersburg, 2011 — P. 30-39.
978-5-288-05225-5
http://elar.urfu.ru/handle/10995/3709
 
Язык en
 
Связанные ресурсы RuSSIR/EDBT2011
 
Формат 200791 bytes
application/pdf
 
Издатель St. Petersburg University Press