15 January 2024 in Knowledge-Based Systems
28 December 2022 in Knowledge-Based Systems
2 November 2021 in International Journal of Machine Learning and Cybernetics
25 July 2024 in IEEE Transactions on Artificial Intelligence
The primary objective of classical multi-view clustering is to categorize data into separate clusters under the assumption that all perspectives are completely available. However, in practical situations, it is common to encounter cases where not all viewpoints of the data are accessible. This limitation can impede the effectiveness of traditional multi-view clustering methods. The incompleteness of the clustering of multi-view data has witnessed substantial progress in recent years due to its promising applications. In response to the aforementioned issue, we have tackled it by introducing an inventive multi-view clustering algorithm that is tailored to handle incomplete data from various views. Additionally, we have proposed a distinct objective function that leverages a weighted concept factorization technique to address the absence of data instances within each incomplete perspective. To address inconsistencies between different views, we introduced a co-regularization factor, which operates in conjunction with a shared consensus matrix. It is important to highlight that the proposed objective function is intrinsically non-convex, presenting challenges in terms of optimization. To secure the optimal solution for this objective function, we have implemented an iterative optimization approach to reach the local minima for our method. To underscore the efficacy and validation of our approach, we experimented with real-world datasets and used state-of-the-art methods to perform comparative assessments.
18 March 2024 in IEEE Transactions on Intelligent Transportation Systems
The rapid growth of Internet services dramatically drives the development of various intelligent technologies. As an important composition, modern ride-hailing platforms allow citizens to order taxis in a fast, simple, and secure manner. The key to developing a successful ride-hailing system largely depends on efficient fleet management that narrows the demand-supply gap. For this reason, many Deep Reinforcement Learning (DRL) frameworks are becoming increasingly popular for proactive taxi dispatching. However, existing approaches have very coarse formulations and solutions to the dispatching problem, which overly simplify the real situations. To this end, we propose a fine-grained DRL framework for effective taxi dispatching with tractable solutions. Our framework features three components 1) The basic model is a multi-agent DRL that optimizes the standard objectives (i.e., fulfilling the taxi orders). To reduce the status space and environment dynamics, we cluster regions based on their daily moving patterns and allow agents in the same cluster to learn cooperatively by sharing their policies, i.e., learning from like-pattern peers. 2) We further employ a recurrent neural network to forecast the demand and supply, which helps the agents make globally optimal decisions 3) Finally, we design a two-phase central dispatching strategy based on Maximum Network Flow to relocate taxis in fine granularity. We conduct extensive experiments in a realistic environment simulator using a real-world dataset, and the results demonstrate the superior performance of our new framework over existing approaches, promoting the average total order response rate by $2.67\%$ , taxi effort gain by $25.77\%$ , and decreasing the average number of repositions by $2.96\%$ .
18 December 2024 in Information Sciences