Methods for clustering in binary case and its application.

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F03%3A00008390" target="_blank" >RIV/61989100:27240/03:00008390 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Methods for clustering in binary case and its application.

Original language description

The paper presents a document analysis case based on similarity measures between two documents. The algorithm is based on the proximity matrix. Initially, the document-term matrix is converted into a proximity matrix. The proximity matrix is then processed using standard clustering algorithms. Comparative numerical results are provided.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F01%2F1192" target="_blank" >GA201/01/1192: Research of neural networks capability to provide nonlinear Boolean factor analysis</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Znalosti 2003

ISBN

ISBN 80-248-022

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

43-52

Publisher name

VŠB - Technická univerzita Ostrava

Place of publication

Ostrava

Event location

Ostrava

Event date

Jan 1, 2003

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—