Binary Factor Analysis with Genetic Algorithms

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F05%3A00009866" target="_blank" >RIV/61989592:15310/05:00009866 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Binary Factor Analysis with Genetic Algorithms

Original language description

Binary factor analysis (BFA) is a nonhierarchical binary data analysis, based on reduction of binary space dimension. It allows us to find hidden relationships in binary data, which can be used for efficient data compression, data mining, or intelligentdata comparison for information retrieval. It seems that genetic algorithm (GA) may be used to find the solution. This paper describes two GA variants usable for BFA. The better one is described in detail, and results of some experiments are shown, comparing it with other known BFA methods. The experiments reveal that the new method based on revised genetic algorithm performs very well.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

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

Name of the periodical

Advances in Soft Computing

ISSN

1615-3871

e-ISSN

—

Volume of the periodical

29

Issue of the periodical within the volume

29

Country of publishing house

DE - GERMANY

Number of pages

1358

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—