Tesi etd-06272015-133642 |
Link copiato negli appunti
Tipo di tesi
Tesi di laurea magistrale
Autore
BUDINICH, RENATO
URN
etd-06272015-133642
Titolo
A constrained maximum entropy principle for data reduction via pattern selection
Dipartimento
MATEMATICA
Corso di studi
MATEMATICA
Relatori
relatore Prof. Punzi, Giovanni
relatore Prof.ssa Del Viva, Maria Michela
relatore Prof. Gueorguiev, Vladimir Simeonov
relatore Prof.ssa Del Viva, Maria Michela
relatore Prof. Gueorguiev, Vladimir Simeonov
Parole chiave
- matematica applicata
- neuroscienze
- ottimizzazione combinatoria
Data inizio appello
17/07/2015
Consultabilità
Completa
Riassunto
Both in the neurological human vision system and in certain HEP particle detectors a strong
reduction of information happens at an early stage; following previous works of D. Benedetti, G. Punzi and
M. del Viva we state an abstract optimality principle which, taking into account storage and bandwidth
limits of the system, could explain the most efficient way for this data filtering process to happen. We
develop a mathematical model which formalizes this principle into a 0-1 combinatorial optimization
problem, reformulate it as a simple optimal path problem on a graph, and propose a simple albeit
inefficient algorithm to solve it; we prove the solution is not unique and the problem suffers from a form
of instableness in this regard, and propose a possible approximation which partially solves the issues with
the exact algorithm. Finally we compare, for various values of the model parameters, the behavior of the
exact solution with the computationally much simpler heuristic solution proposed by the original authors,
and we find there’s a range of values for which they behave very similarly.
reduction of information happens at an early stage; following previous works of D. Benedetti, G. Punzi and
M. del Viva we state an abstract optimality principle which, taking into account storage and bandwidth
limits of the system, could explain the most efficient way for this data filtering process to happen. We
develop a mathematical model which formalizes this principle into a 0-1 combinatorial optimization
problem, reformulate it as a simple optimal path problem on a graph, and propose a simple albeit
inefficient algorithm to solve it; we prove the solution is not unique and the problem suffers from a form
of instableness in this regard, and propose a possible approximation which partially solves the issues with
the exact algorithm. Finally we compare, for various values of the model parameters, the behavior of the
exact solution with the computationally much simpler heuristic solution proposed by the original authors,
and we find there’s a range of values for which they behave very similarly.
File
Nome file | Dimensione |
---|---|
tesi_Bud..._29_6.pdf | 3.35 Mb |
Contatta l’autore |