- Bayesian learning; Bayesian signal processing (MLR-BAYL)
- Bounds on performance (MLR-PERF)
- Applications in Systems Biology (MLR-SYSB)
- Applications in Music and Audio Processing (MLR-MUSI)
- Applications in Data Fusion (MLR-FUSI)
- Cognitive information processing (MLR-COGP)
- Distributed and Cooperative Learning (MLR-DIST)
- Learning theory and algorithms (MLR-LEAR)
- Neural network learning (MLR-NNLR)
- Information-theoretic learning (MLR-INFO)
- Independent component analysis (MLR-ICAN)
- Graphical and kernel methods (MLR-GRKN)
- Other applications of machine learning (MLR-APPL)
- Pattern recognition and classification (MLR-PATT)
- Source separation (MLR-SSEP)
- Sequential learning; sequential decision methods (MLR-SLER)
In this paper, we analyse the process of designing a Content-
Based 3D shape Retrieval (CB3DR) adapted for non-experts.
Our CB3DR solution aims at scanning an object on the fly
with a low-cost 3D sensor and retrieve similar shapes from
a database using the 3D point cloud acquired. Our system
should meet the requirements of archaeologists who would
like to be able to acquire artefacts without prior expertise in
scanning, then query easily from the field knowledge bases
for Cultural Heritage, and thus retrieve artefacts (i.e. objects
When interacting with mobile apps, users need to take decisions and make certain choices out of a set of alternative ones offered by the app. We introduce optimization problems through which we engineer the choices presented to users so that they are nudged towards decisions that lead to better outcomes for them and for the app platform. User decision-making rules are modeled by using principles from behavioral science and machine learning.
In this paper, distributed learning is studied using the approach of coreset. In the context of classification, an algorithm of coreset construction is proposed to reduce the redundancy of data and thus the communication requirement, similarly to source coding in traditional data communications. It is shown that the coreset based boosting has a high convergence rate and small sample complexity. Moreover, it is robust to adversary distribution, thus leading to potential applications in distributed learning systems.
We consider autoencoders (AEs) for matrix completion (MC) with application to collaborative filtering (CF) for recommedation systems. It is observed that for a given sparse user-item rating matrix, denoted asM, an AE performs matrix factorization so that the recovered matrix is represented as a product of user and item feature matrices.
Clustering is widely used for exploratory data analysis in a variety of applications. Traditionally clustering is studied as an unsupervised task where no human inputs are provided. A recent trend in clustering is to leverage user provided side information to better infer the clustering structure in data. In this paper, we propose a probabilistic graphical model that allows user to provide as input the desired cluster sizes, namely the cardinality constraints. Our model also incorporates a flexible mechanism to inject control of the crispness of the clusters.