Gian Alix

Mr. Gian Alix

York University
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2022 in Journal of Chemometrics
Verified
Journal Article
Closed access
Gian AlixGian Alix
Gian Alix
ELElizabeth Lymer
Elizabeth Lymer
GZGuanlin Zhang
Guanlin Zhang
MDMichael Daly
Michael Daly
XGXin Gao
Xin Gao

13 November 2023
Verified
Conference Paper
Open access
AFAli Faraji
Ali Faraji
JLJing Li
Jing Li
Gian AlixGian Alix
Gian Alix
MAMahmoud Alsaeed
Mahmoud Alsaeed
NYNina Yanin
Nina Yanin
MPManos Papagelis
Manos Papagelis
Research on trajectory data mining relies on appropriate datasets, including Gps-based geolocations, check-in data to points of interest (Pois), and synthetic datasets. Even though some data are accessible, the majority of mobility datasets are typically discovered through ad-hoc searches and lack comprehensive documentation of their generation process or source to reproduce curated or customized versions of them. At the same time, there has been a growing interest in a new type of mobility data, describing trajectories as sequences of higher-order geometric elements like hexagons that offer several benefits: (i) reduced sparsity and analysis at different granularity levels, (ii) compatibility with popular machine learning architectures, (iii) improved generalization and reduced overfitting, and (iv) efficient visualization. To this end, we present Point2Hex, a method and tool for generating higher-order mobility flow datasets from raw trajectory data. We used Point2Hex to create higherorder versions of seven popular mobility datasets typically employed in trajectory-related technical problems and downstream tasks, such as trajectory prediction, classification, clustering, imputation, and anomaly detection, to name a few. To promote reuse and encourage reproducibility, we provide the source code and documentation of Point2Hex, as well as the generated higher-order mobility flow datasets in publicly accessible repositories.

8 July 2021 in Diabetology
Verified
Journal Article
Open access
PDF file
Gian AlixGian Alix
Gian Alix
HHHuaxiong Huang
Huaxiong Huang
AGAziz Guergachi
Aziz Guergachi
KKKarim Keshavjee
Karim Keshavjee
XGXin Gao
Xin Gao
An online risk prediction tool is developed to calculate a user’s risk of developing type II diabetes mellitus (T2DM). The risk prediction is based on the user’s input of medical lab information, such as age, sex, body mass index, fasting blood sugar, triglycerides, and high-density lipoprotein levels. The calculator is modelled using a logistic regression model, and it is trained using the medical records of over ten thousand Canadian patients. This newly developed tool is intended to serve physicians and patients in predicting future diabetes risk and take early preventive measures.

25 April 2026 in ACM Transactions on Spatial Algorithms and Systems
Verified
Journal Article
Open access
Gian AlixGian Alix
Gian Alix
AHArian Haghparast
Arian Haghparast
MPManos Papagelis
Manos Papagelis
Advances in tracking technologies have spurred the rapid growth of large-scale trajectory data. Building a compact collection of pathlets, referred to as a trajectory pathlet dictionary , is essential for supporting mobility-related applications. Existing methods typically adopt a top-down approach, generating numerous candidate pathlets and selecting a subset, leading to high memory usage and redundant storage from overlapping pathlets. To overcome these limitations, we propose a bottom-up strategy that incrementally merges basic pathlets to build the dictionary, reducing memory requirements by up to 24,000 times compared to baseline methods. The approach begins with unit-length pathlets and iteratively merges them while optimizing utility, which is defined using newly introduced metrics of trajectory loss and representability . We develop a deep reinforcement learning framework, PathletRL , which utilizes Deep Q-Networks ( DQN ) to approximate the utility function, resulting in a compact and efficient pathlet dictionary. Experiments on both synthetic and real-world datasets demonstrate that our method outperforms state-of-the-art techniques, reducing the size of the constructed dictionary by up to 65.8%. Additionally, our results show that only half of the dictionary pathlets are needed to reconstruct 85% of the original trajectory data. Building on PathletRL , we introduce PathletRL++ , which extends the original model by incorporating a richer state representation and an improved reward function to optimize decision-making during pathlet merging. These enhancements enable the agent to gain a more nuanced understanding of the environment, leading to higher-quality pathlet dictionaries. PathletRL++ achieves even greater dictionary size reduction, surpassing the performance of PathletRL , while maintaining high trajectory representability.

13 November 2023
Verified
Conference Paper
Open access
Gian AlixGian Alix
Gian Alix
MPManos Papagelis
Manos Papagelis
Sophisticated location and tracking technologies have led to the generation of vast amounts of trajectory data. Of interest is constructing a small set of basic building blocks that can represent a wide range of trajectories, known as a trajectory pathlet dictionary. This dictionary can be useful in various tasks and applications, such as trajectory compression, travel time estimation, route planning, and navigation services. Existing methods for constructing a pathlet dictionary use a top-down approach, which generates a large set of candidate pathlets and selects the most popular ones to form the dictionary. However, this approach is memory-intensive and leads to redundant storage due to the assumption that pathlets can overlap. To address these limitations, we propose a bottom-up approach for constructing a pathlet dictionary that significantly reduces memory storage needs of baseline methods by multiple orders of magnitude (by up to ~24K× better). The key idea is to initialize unit-length pathlets and iteratively merge them, while maximizing utility. The utility is defined using newly introduced metrics of trajectory loss and representability. A deep reinforcement learning method is proposed, PathletRL, that uses Deep Q Networks (Dqn) to approximate the utility function. Experiments show that our method outperforms the current state-of-the-art, both on synthetic and real-world data. Our method can reduce the size of the constructed dictionary by up to 65.8% compared to other methods. It is also shown that only half of the pathlets in the dictionary is needed to reconstruct 85% of the original trajectory data.