Dimensionality Reduction and Extremal Parameter Grouping for Weighted Graph Problems

Vostrov, G.; Khrinenko, A.

dc.contributor.author	Vostrov, G.
dc.contributor.author	Khrinenko, A.
dc.date.accessioned	2020-01-10T12:29:39Z
dc.date.available	2020-01-10T12:29:39Z
dc.date.issued	2019
dc.identifier.citation	Vostrov, G. Dimensionality Reduction and Extremal Parameter Grouping for Weighted Graph Problems / G. Vostrov, A. Khrinenko // Информац. управляющие системы и технологии. Проблемы и решения : монография. – Одесса : Экология, 2019. - С. 226-238.	en
dc.identifier.issn	978-617-7046-88-1
dc.identifier.uri	http://dspace.opu.ua/jspui/handle/123456789/10095
dc.description.abstract	This work presents graph cut approach to dimensionality reduction and shows connections between the problem of extremal parameter grouping and the problem of maximization of positive definite quadratic form on the set of vertices of k-dimensional hypercube of side 1 by modulo. It is shown that the last problem is reduced to the minimum negative cut search for a weighted graph. A heuristic algorithm for solving this problem is given.	en
dc.language.iso	en_US	en
dc.publisher	Одесса "Экология"	en
dc.subject	Datasets	en
dc.subject	dimensionality reduction	en
dc.subject	graphs	en
dc.title	Dimensionality Reduction and Extremal Parameter Grouping for Weighted Graph Problems	en
dc.type	Article	en
opu.kafedra	Кафедра інформаційних технологій	uk
opu.citation.journal	Информационные управляющие системы и технологии. Проблемы и решения	en
opu.citation.firstpage	226	en
opu.citation.lastpage	238	en
opu.staff.id	but.n.v@opu.ua	en