22 November 2024 in ACM Computing Surveys
As social media platforms evolve from text-based forums into multi-modal environments, the nature of misinformation in social media is also transforming accordingly. Taking advantage of the fact that visual modalities such as images and videos are more favorable and attractive to users, and textual content is sometimes skimmed carelessly, misinformation spreaders have recently targeted contextual connections between the modalities, e.g., text and image. Hence, many researchers have developed automatic techniques for detecting possible cross-modal discordance in web-based content. We analyze, categorize, and identify existing approaches in addition to the challenges and shortcomings they face to unearth new research opportunities in the field of multi-modal misinformation detection.
27 September 2019 in IEEE Access
Millimeter wave (mmWave) has been claimed to be the only viable solution for high-bandwidth vehicular communications. However, frequent channel estimation and beamforming required to provide a satisfactory quality of service limits mmWave for vehicular communications. In this paper, we propose a novel channel estimation and beam tracking framework for mmWave communications in a vehicular network setting. For channel estimation, we propose an algorithm termed robust adaptive multi-feedback (RAF) that achieves comparable estimation performance as existing channel estimation algorithms, with a significantly smaller number of feedback bits. We derive upper and lower bounds on the probability of estimation error (PEE) of the RAF algorithm, given a number of channel estimations, whose accuracy is verified through Monte Carlo simulations. For beam tracking, we propose a new practical model for mmWave vehicular communications. In contrast to the prior works, the model is based on position, velocity, and channel coefficient, which allows a significant improvement of the tracking performance. Focused on the new beam tracking model, we re-derive the equations for Jacobian matrices, reducing the complexity for vehicular communications. An extensive number of simulations is conducted to show the superiority of our proposed channel estimation method and beam tracking algorithm in comparison with the existing algorithms and models. Our simulations suggest that the RAF algorithm can achieve the desired PEE, while on average, reducing the feedback overhead by 75.5% and the total channel estimation time by 14%. The beam tracking algorithm is also shown to significantly improve beam tracking performance, allowing more room for data transmission.
7 January 2020 in IEEE Transactions on Knowledge and Data Engineering
Publishing datasets plays an essential role in open data research and promoting transparency of government agencies. However, such data publication might reveal users' private information. One of the most sensitive sources of data is spatiotemporal trajectory datasets. Unfortunately, merely removing unique identifiers cannot preserve the privacy of users. Adversaries may know parts of the trajectories or be able to link the published dataset to other sources for the purpose of user identification. Therefore, it is crucial to apply privacy preserving techniques before the publication of spatiotemporal trajectory datasets. In this paper, we propose a robust framework for the anonymization of spatiotemporal trajectory datasets termed as machine learning based anonymization (MLA). By introducing a new formulation of the problem, we are able to apply machine learning algorithms for clustering the trajectories and propose to use k-means algorithm for this purpose. A variation of k-means algorithm is also proposed to preserve the privacy in overly sensitive datasets. Moreover, we improve the alignment process by considering multiple sequence alignment as part of the MLA. The framework and all the proposed algorithms are applied to T-Drive, Geolife, and Gowalla location datasets. The experimental results indicate a significantly higher utility of datasets by anonymization based on MLA framework.
11 May 2020 in IEEE Transactions on Mobile Computing
Recent years have seen rising needs for location-based services in our everyday life. Aside from the many advantages provided by these services, they have caused serious concerns regarding the location privacy of users. Adversaries can monitor the queried locations by users to infer sensitive information, such as home addresses and shopping habits. To address this issue, dummy-based algorithms have been developed to increase the anonymity of users, and thus, protecting their privacy. Unfortunately, the existing algorithms only assume a limited amount of side information known by adversaries, which may face more severe challenges in practice. In this paper, we develop an attack model termed as Viterbi attack, which represents a realistic privacy threat on user trajectories. Moreover, we propose a metric called transition entropy that enables the evaluation of dummy-based algorithms, followed by developing a robust algorithm that can defend users against the Viterbi attack while maintaining significantly high performance in terms of the traditional metrics. We compare and evaluate our proposed algorithm and metric on a publicly available dataset published by Microsoft, i.e., Geolife dataset.
22 January 2025 in IEEE Transactions on Artificial Intelligence
Privacy and fairness are two crucial pillars of responsible Artificial Intelligence (AI) and trustworthy Machine Learning (ML). Each objective has been independently studied in the literature with the aim of reducing utility loss in achieving them. Despite the significant interest attracted from both academia and industry, there remains an immediate demand for more in-depth research to unravel how these two objectives can be simultaneously integrated into ML models. As opposed to well-accepted trade-offs, i.e., privacy-utility and fairness-utility, the interrelation between privacy and fairness is not well-understood. While some works suggest a trade-off between the two objective functions, there are others that demonstrate the alignment of these functions in certain scenarios. To fill this research gap, we provide a thorough review of privacy and fairness in ML, including supervised, unsupervised, semi-supervised, and reinforcement learning. After examining and consolidating the literature on both objectives, we present a holistic survey on the impact of privacy on fairness, the impact of fairness on privacy, existing architectures, their interaction in application domains, and algorithms that aim to achieve both objectives while minimizing the utility sacrificed. Finally, we identify research challenges in achieving privacy and fairness concurrently in ML, particularly focusing on large language models.
2 October 2022 in Proceedings of the VLDB Endowment
Fairness in data-driven decision-making studies scenarios where individuals from certain population segments may be unfairly treated when being considered for loan or job applications, access to pu...