Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alejandro Mottini

dblp:117/0478 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0002-5880-9884ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Graph learning · 46% Representation and self-supervised learning · 36% Transfer learning and domain adaptation · 18%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 6 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
multimodal representation learning
0.912025
Multi-Modal Multi-Task Unified Embedding Model (M3T-UEM): A Task-Adaptive Representation Learning Framework · ICCV 2025
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
unified embedding
0.912025
Multi-Modal Multi-Task Unified Embedding Model (M3T-UEM): A Task-Adaptive Representation Learning Framework · ICCV 2025
Machine learning › Graph learning
graph construction
0.812024
GraphStorm: All-in-one Graph Machine Learning Framework for Industry Applications · KDD 2024
Machine learning › Graph learning
graph neural network
0.812024
GraphStorm: All-in-one Graph Machine Learning Framework for Industry Applications · KDD 2024
Machine learning › Graph learning › graph neural network
scalable graph neural network
0.812024
GraphStorm: All-in-one Graph Machine Learning Framework for Industry Applications · KDD 2024
Recommender systems
choice modeling
0.312017
Deep Choice Model Using Pointer Networks for Airline Itinerary Prediction · KDD 2017

Methods — techniques the papers use, named apart from their topics

graph neural network · 1.5multimodal embedding · 0.9multi-task learning · 0.9recurrent neural network · 0.3pointer network · 0.3multinomial logit · 0.3attention mechanism · 0.3
YearPublicationVenuePosition
2025 Multi-Modal Multi-Task Unified Embedding Model (M3T-UEM): A Task-Adaptive Representation Learning Framework
Rohan Sharma, Changyou Chen, Feng-Ju Chang, Seongjun Yun, Xiaohu Xie, Dehong Xu, Alejandro Mottini, Qingjun Cui
ICCV8
2024 GraphStorm: All-in-one Graph Machine Learning Framework for Industry Applications
abstract
Graph machine learning (GML) is effective in many business applications. However, making GML easy to use and applicable to industry applications with massive datasets remain challenging. We developed GraphStorm, which provides an end-to-end solution for scalable graph construction, graph model training and inference. GraphStorm has the following desirable properties: (a) Easy to use: it can perform graph construction and model training and inference with just a single command; (b) Expert-friendly: GraphStorm contains many advanced GML modeling techniques to handle complex graph data and improve model performance; (c) Scalable: every component in GraphStorm can operate on graphs with billions of nodes and can scale model training and inference to different hardware without changing any code. GraphStorm has been used and deployed for over a dozen billion-scale industry applications after its release in May 2023. It is open-sourced in Github: https://github.com/awslabs/graphstorm.
Da Zheng 0004, Xiang Song 0003, Qi Zhu 0008, Jian Zhang 0113, Theodore Vasiloudis, Runjie Ma, Houyu Zhang, Zichen Wang 0002, Soji Adeshina, Israt Nisa, Alejandro Mottini, Qingjun Cui, Huzefa Rangwala, Belinda Zeng, Christos Faloutsos, George Karypis
KDD11
2021 Top-Down Attention in End-to-End Spoken Language Understanding
abstract
Spoken language understanding (SLU) is the task of inferring the semantics of spoken utterances. Traditionally, this has been achieved with a cascading combination of Automatic Speech Recognition (ASR) and Natural Language Understanding (NLU) modules that are optimized separately, which can lead to a suboptimal overall performance. More recently, End-to-End SLU (E2E SLU) was proposed to perform SLU directly from speech through a joint optimization of the modules, addressing some of the traditional SLU shortcomings. A key challenge of this approach is how to best integrate the feature learning of the ASR and NLU sub-tasks to maximize their performance. While it is known that in general, ASR models focus on low-level features, and NLU models need higher-level contextual information, ASR models can nonetheless also leverage top-down syntactic and semantic information to improve their recognition. Based on this insight, we propose Top-Down SLU (TD-SLU), a new transformer-based E2E SLU model that uses top-down attention and an attention gate to fuse high-level NLU features with low-level ASR features, which leads to a better optimization of both tasks. We have validated our model using the public FluentSpeech set, and a large custom dataset. Results show TD-SLU is able to outperform selected baselines both in terms of ASR and NLU quality metrics, and suggest that the added syntactic and semantic high-level information can improve the model’s performance.
Yixin Chen 0003, Weiyi Lu, Alejandro Mottini, Li Erran Li, Jasha Droppo, Zheng Du, Belinda Zeng
ICASSP3
2017 Deep Choice Model Using Pointer Networks for Airline Itinerary Prediction
abstract
Travel providers such as airlines and on-line travel agents are becoming more and more interested in understanding how passengers choose among alternative itineraries when searching for flights. This knowledge helps them better display and adapt their offer, taking into account market conditions and customer needs. Some common applications are not only filtering and sorting alternatives, but also changing certain attributes in real-time (e.g., changing the price). In this paper, we concentrate with the problem of modeling air passenger choices of flight itineraries. This problem has historically been tackled using classical Discrete Choice Modelling techniques. Traditional statistical approaches, in particular the Multinomial Logit model (MNL), is widely used in industrial applications due to its simplicity and general good performance. However, MNL models present several shortcomings and assumptions that might not hold in real applications. To overcome these difficulties, we present a new choice model based on Pointer Networks. Given an input sequence, this type of deep neural architecture combines Recurrent Neural Networks with the Attention Mechanism to learn the conditional probability of an output whose values correspond to positions in an input sequence. Therefore, given a sequence of different alternatives presented to a customer, the model can learn to point to the one most likely to be chosen by the customer. The proposed method was evaluated on a real dataset that combines on-line user search logs and airline flight bookings. Experimental results show that the proposed model outperforms the traditional MNL model on several metrics.
Alejandro Mottini, Rodrigo Acuna-Agost
KDD1
2013 Tree-like Shapes Distance Using the Elastic Shape Analysis Framework
abstract
The analysis and comparison of tree-like shapes is of great importance since many structures in nature can be described by them. In the field of biomedical imaging, trees have been used to describe structures such as neurons, blood vessels and lung airways. Since it is known that their morphology provides information on their functioning and allows the characterization of pathological states, it is of paramount importance to develop methods to analyze their shape and to quantify differences in structures. At present, there are a number of methods for the comparison of trees. Some only take into account the topology of the trees (such as [1], [2]), while others consider both topological and geometrical information (such as [3], [4]).
Alejandro Mottini, Xavier Descombes, Florence Besse
BMVC1