Участник:Valerie Kovaleva
Материал из MachineLearning.
(Новая: МФТИ, ФУПМ Кафедра "Интеллектуальные системы" Направление "Интеллектуальный анализ данных" valeriya.kovaleva@...) |
|||
| Строка 1: | Строка 1: | ||
| - | МФТИ, ФУПМ | + | МФТИ, ФУПМ |
| - | Кафедра "Интеллектуальные системы" | + | |
| - | Направление "Интеллектуальный анализ данных" | + | Кафедра "Интеллектуальные системы" |
| - | valeriya.kovaleva@phystech.edu | + | |
| + | Направление "Интеллектуальный анализ данных" | ||
| + | |||
| + | valeriya.kovaleva@phystech.edu | ||
| + | |||
| + | == Научно-исследовательская работа == | ||
| + | |||
| + | === Весна 2016, 6-й семестр === | ||
| + | "Spectra of tree ensembles", V. Kovaleva, O. Valba | ||
| + | |||
| + | Abstract | ||
| + | |||
| + | This paper is devoted to spectra of sparse macromolecular clusters. We suggest such clusters to be modeled by unweighed undirected tree ensembles with size distributed in a certain known way. The goal of this work is to compute spectra of such ensembles analytically as spectra of their adjacency matrices. The motivation to the problem investigated is computing spectra of Bernoulli noise in sparse matrices which is essential in cases when the scale of the data and the noise is the same. We solve the special cases of star trees and full binary trees interpreting them as generalized Bethe trees. The target function of an individual tree is supposed to depend on the size of the tree and of an ensemble - on size distribution. | ||
| + | |||
| + | Keywords: binary trees; star trees; spectrum | ||
| + | |||
| + | Соблаговолите написать письмо.. | ||
Версия 09:24, 7 сентября 2016
МФТИ, ФУПМ
Кафедра "Интеллектуальные системы"
Направление "Интеллектуальный анализ данных"
valeriya.kovaleva@phystech.edu
Научно-исследовательская работа
Весна 2016, 6-й семестр
"Spectra of tree ensembles", V. Kovaleva, O. Valba
Abstract
This paper is devoted to spectra of sparse macromolecular clusters. We suggest such clusters to be modeled by unweighed undirected tree ensembles with size distributed in a certain known way. The goal of this work is to compute spectra of such ensembles analytically as spectra of their adjacency matrices. The motivation to the problem investigated is computing spectra of Bernoulli noise in sparse matrices which is essential in cases when the scale of the data and the noise is the same. We solve the special cases of star trees and full binary trees interpreting them as generalized Bethe trees. The target function of an individual tree is supposed to depend on the size of the tree and of an ensemble - on size distribution.
Keywords: binary trees; star trees; spectrum
Соблаговолите написать письмо..
