Simone Santini

STAT-MECH
6papers
3citations
Novelty30%
AI Score15

6 Papers

STAT-MECHJul 15, 2020
Network navigation using Page Rank random walks

Emilio Aced Fuentes, Simone Santini

We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial conditions and settles to a steady state that depends only on the characteristics of the network. In the special case in which the walk begins from a single node, we find that the largest eigenvalue of the transition value (lambda=1) does not contribute to the dynamic and that the probability is constant in the direction of the corresponding eigenvector. We study the process of visiting new node, which we find to have a dynamic similar to that of the occupancy probability. Finally, we determine the average transit time between nodes <T>, which we find to exhibit certain connection with the corresponding time for Levy walks. The relevance of these results reside in that Page Rank, which are a more reasonable model for the searching behavior of individuals, can be shown to exhibit features similar to Levy walks, which in turn have been shown to be a reasonable model of a common large scale search strategy known as "Area Restricted Search".

STAT-MECHJun 25, 2020
A random walk on Area Restricted Search

Simone Santini

These notes from a graduate class at the Unuversidad Autonoma de Madrid analyze a search behavior known as Area Resticted Search (ARS), widespread in the animal kingdom, and optimal when the resources that one is after are "patchy". In the first section we study the importance of the behavior in animal and its dependence on the dopamine as a indicator of reward. In the second section we put together a genetic algorithm to determine the optimality of ARS and its characteristics. Finally, we relate ARS to a type of random walks known as "Levy Walks", in which the probability of jumping at a distance d from the current location follows a power law distribution.

MMDec 27, 2019
Structural characterization of musical harmonies

Maria Rojo González, Simone Santini

Understanding the structural characteristics of harmony is essential for an effective use of music as a communication medium. Of the three expressive axes of music (melody, rhythm, harmony), harmony is the foundation on which the emotional content is built, and its understanding is important in areas such as multimedia and affective computing. The common tool for studying this kind of structure in computing science is the formal grammar but, in the case of music, grammars run into problems due to the ambiguous nature of some of the concepts defined in music theory. In this paper, we consider one of such constructs: modulation, that is, the change of key in the middle of a musical piece, an important tool used by many authors to enhance the capacity of music to express emotions. We develop a hybrid method in which an evidence-gathering numerical method detects modulation and then, based on the detected tonalities, a non-ambiguous grammar can be used for analyzing the structure of each tonal component. Experiments with music from the XVII and XVIII centuries show that we can detect the precise point of modulation with an error of at most two chords in almost 97% of the cases. Finally, we show examples of complete modulation and structural analysis of musical harmonies.

IRJun 15, 2019
Relevance Feedback with Latent Variables in Riemann spaces

Simone Santini

In this paper we develop and evaluate two methods for relevance feedback based on endowing a suitable "semantic query space" with a Riemann metric derived from the probability distribution of the positive samples of the feedback. The first method uses a Gaussian distribution to model the data, while the second uses a more complex Latent Semantic variable model. A mixed (discrete-continuous) version of the Expectation-Maximization algorithm is developed for this model. We motivate the need for the semantic query space by analyzing in some depth three well-known relevance feedback methods, and we develop a new experimental methodology to evaluate these methods and compare their performance in a neutral way, that is, without making assumptions on the system in which they will be embedded.

IRNov 24, 2018
Novelty and Coverage in context-based information filtering

Alexandra Dumitrescu, Simone Santini

We present a collection of algorithms to filter a stream of documents in such a way that the filtered documents will cover as well as possible the interest of a person, keeping in mind that, at any given time, the offered documents should not only be relevant, but should also be diversified, in the sense not only of avoiding nearly identical documents, but also of covering as well as possible all the interests of the person. We use a modification of the WEBSOM algorithm, with limited architectural adaptation, to create a user model (which we call the "user context" or simply the "context") based on a network of units laid out in the word space and trained using a collection of documents representative of the context. We introduce the concepts of novelty and coverage. Novelty is related to, but not identical to, the homonymous information retrieval concept: a document is novel it it belongs to a semantic area of interest to a person for which no documents have been seen in the recent past. A group of documents has coverage to the extent to which it is a good representation of all the interests of a person. In order to increase coverage, we introduce an "interest" (or "urgency") factor for each unit of the user model, modulated by the scores of the incoming documents: the interest of a unit is decreased drastically when a document arrives that belongs to its semantic area and slowly recovers its initial value if no documents from that semantic area are displayed. Our tests show that these algorithms can effectively increase the coverage of the documents that are shown to the user without overly affecting precision.

SEMay 11, 2018
Semiotic internationalization and localization of computer programs

Simone Santini

Localization, the process--part of translation studies--of adapting a program to a new linguistic community, is often intended in the relatively narrow sense of translating the messages and labels of the program into the target language. Correspondingly, internationalization, the discipline--which is part of software engineering--of putting in place all the measures that will make localization easier, is also limited in scope. In this paper we analyze the various systems through which a program communicates with a person (icons, buttons, actions, interface layout, etc.) and find that most of them, far from being iconic, are in reality symbolic semiotic systems related to the culture in which or for which the program was developed (typically American programmers of western office workers). Based on these findings, we argue that during the localization process, the translator should have the option to translate them all, that is, to adapt the whole interface and its founding metaphors to the cultural environment in which the program is deployed. This conclusion will result in a greater role for internationalization in the software development process, and we outline a few architectural principles that should be considered when creating a program for a multi-cultural market.