IPMU
330 papers
Clustering belief functions based on attracting and conflicting metalevel evidence
In this paper we develop a method for clustering belief functions based on attracting and conflicting metalevel evidence. Such clustering is done when the belief functions concern multiple events,...
A Typology of Data Anomalies
Anomalies are cases that are in some way unusual and do not appear to fit the general patterns present in the dataset. Several conceptualizations exist to distinguish between different types of...
Fast Dempster-Shafer clustering using a neural network structure
In this paper we study a problem within Dempster-Shafer theory where 2**n - 1 pieces of evidence are clustered by a neural structure into n clusters. The clustering is done by minimizing a...
Classification of Message Spreading in a Heterogeneous Social Network
Nowadays, social networks such as Twitter, Facebook and LinkedIn become increasingly popular. In fact, they introduced new habits, new ways of communication and they collect every day several...
Learning Tversky Similarity
In this paper, we advocate Tversky's ratio model as an appropriate basis for computational approaches to semantic similarity, that is, the comparison of objects such as images in a semantically...
Possibilistic semantics for a modal KD45 extension of G\"odel fuzzy logic
In this paper we provide a simplified semantics for the logic KD45(G), i.e. the many-valued G\"odel counterpart of the classical modal logic KD45. More precisely, we characterize KD45(G) as the...
Uncertainty in Ontology Matching: A Decision Rule-Based Approach
Considering the high heterogeneity of the ontologies pub-lished on the web, ontology matching is a crucial issue whose aim is to establish links between an entity of a source ontology and one or...
Independence of Sources in Social Networks
Online social networks are more and more studied. The links between users of a social network are important and have to be well qualified in order to detect communities and find influencers for...
Enhancing Bayesian Network Structural Learning with Monte Carlo Tree Search
This article presents MCTS-BN, an adaptation of the Monte Carlo Tree Search (MCTS) algorithm for the structural learning of Bayesian Networks (BNs). Initially designed for game tree exploration,...
Rotations of G\"odel algebras with modal operators
The present paper is devoted to study the effect of connected and disconnected rotations of G\"odel algebras with operators grounded on directly indecomposable structures. The structures resulting...