Cellular Trajectory Map-Matching (CTMM) aims to align cellular location sequences to road networks, which is a necessary preprocessing in location-based services on web platforms like Google Maps, including navigation and route optimization. Current approaches mainly rely on ID-based features and region-specific data to learn correlations between cell towers and roads, limiting their adaptability to unexplored areas. To enable high-accuracy CTMM without additional training in target regions, Zero-shot CTMM requires to extract not only region-adaptive features, but also sequential and location uncertainty to alleviate positioning errors in cellular data. In this paper, we propose a pixel-based trajectory calibration assistant for zero-shot CTMM, which takes advantage of transferable geospatial knowledge to calibrate pixelated trajectory, and then guide the path-finding process at the road network level. To enhance knowledge sharing across similar regions, a Gaussian mixture model is incorporated into VAE, enabling the identification of scenario-adaptive experts through soft clustering. To mitigate high positioning errors, a spatial-temporal awareness module is designed to capture sequential features and location uncertainty, thereby facilitating the inference of approximate user positions. Finally, a constrained path-finding algorithm is employed to reconstruct the road ID sequence, ensuring topological validity within the road network. This process is guided by the calibrated trajectory while optimizing for the shortest feasible path, thus minimizing unnecessary detours. Extensive experiments demonstrate that our model outperforms existing methods in zero-shot CTMM by 16.8\%.

The proliferation of Massive Open Online Courses (MOOCs) has created an urgent need for advanced course recommendation systems (RS). Course recommendations in MOOCs require transparent motivations to justify course selection, as there are often many courses with the same title, but which vary widely in content, duration, learning resources provided, and the academic authority of the instructor. Explainable recommendations are crucial to ensure that recommended courses fit well with learners’ needs and increase the chance of successful course completion, but unfortunately existing RS for MOOCs struggle to provide explainable recommendations. In this article, we present KnowPath , a novel RS for MOOCs, which generates effective and explainable recommendations. KnowPath uses open source Large Language Models (LLMs) to construct knowledge graphs (KGs) capable of accurately capturing complex relationships between MOOC entities (e.g., learners, instructors, educational resources) and employs Reinforcement Learning to align the output of an LLM with learner preferences. Extensive experiments on two public datasets (XueTang and COCO) demonstrate the superior performance and generalizability of KnowPath , underlining its potential to revolutionize the field of personalized online education.

Stock prediction is an attractive topic in fintech. However, traditional solutions for stock prediction have two drawbacks: (1) Some focus on the temporal patterns of stocks and model each stock as an independent individual but neglect their relations. Some models consider the relations among stocks, but work in a two-step format (i.e., capturing the temporal patterns first and then considering the relation dependency), which makes them complex and inefficient; (2) They model the stock prediction as a regression (predicting stock price) or classification task (predicting stock trend), which cannot optimize the target of investment, i.e., selecting the best stocks from the exchange market with the highest expected revenue in the future. To fully utilize the relations among stocks and achieve the highest revenue, a relation-temporal graph convolutional network (RT-GCN) is proposed. We first model the relations among stocks and their daily features into a relation-temporal graph. Then, we apply RT-GCN and three relation-aware strategies to realize the relation-temporal feature extraction for each stock. Finally, the features are fed for score calculation in a learning-to-rank way, and the stock with the highest score represents the highest investment revenue in the future. Extensive experiments demonstrate the effectiveness and efficiency of our method.

Epilepsy is one of the most common neurological disorders, and there exists a subset of patients with refractory epilepsy that require surgical removal of the epileptogenic foci (EF) area. Studies have shown that high-frequency oscillations (HFOs) in epileptic electroencephalogram signals can be used as an essential biomarker for locating EF. This paper proposes a new method for rapid localization of EF based on the automatic detection of HFOs by waveform feature templates (WFTs). First, the initial screening of HFOs based on Hilbert transform and subsequent rescreening with short-time energy and short-time Fourier transform is performed, and the two screening results are used as the template data set of HFOs. Then, a coarse-grained and fine-grained screening method for detecting HFOs using autocorrelation coefficients and interrelation coefficients as WFT detectors, respectively. Compared with the Hilbert transform detector and other HFOs detector methods proposed at abroad in recent years, the experimental simulations showed that the automatic detector based on WFT could detect HFOs more rapidly, accurately, and efficiently. Our proposed WFT detector has the advantages of high specificity, high sensitivity, and high accuracy in locating EF and has a high clinical utility.

Epilepsy is a disease caused by abnormal discharges in the central nervous system. Automatic detection and accurate identification of epileptic seizures based on electroencephalography (EEG) are significant in the clinical diagnosis and treatment of epilepsy. In this paper, we first decompose the patient's EEG signal into multiple intrinsic modal functions (IMFs) using empirical modal decomposition, then compute the mean, standard deviation, fluctuation index, and sample entropy of IMF1, and finally classify them using a fusion algorithm of support vector machine and K-nearest neighbor optimized by particle swarm algorithm. The results of validation using the epileptic EEG data set from Bonn University show that the auto-detection and fast recognition method proposed in this paper can achieve a high seizure accuracy recognition rate (≥95%) with only a small number of training samples, which has a good clinical application value.

In this demonstration, we present an end-to-end web-aided data imputation prototype system named WebPut. WebPut consults the Web for imputing the missing values in a local database when the traditional inferring-based imputation method has difficulties in getting the right answers. Specifically, WebPut investigates the interaction between the local inferring-based imputation methods and the web-based retrieving methods and shows that retrieving a small number of selected missing values can greatly improve the imputation recall of the inferring-based methods. Besides, WebPut also incorporates a crowd intervention component that can get advice from humans in case that the web-based imputation methods may have difficulties in making the right decisions. We demonstrate, step by step, how WebPut fills an incomplete table with each of its components.

This study takes the lead to study the aspect/sentiment-aware abstractive review summarization in domain adaptation scenario. The proposed model CASAS (neural attentive model for Cross-domain Aspect/Sentiment-aware Abstractive review Summarization) leverages domain classification task, working on datasets of both source and target domains, to recognize the domain information of texts and transfer knowledge from source domains to target domains. The extensive experiments on Amazon reviews demonstrate that CASAS outperforms the compared methods in both out-of-domain and in-domain setups.

In this paper, we propose a personalized dialogue generation system, which combines reinforcement learning techniques with an attention-based hierarchical recurrent encoderdecoder model. Firstly, we incorporate user-specific information into the decoder to capture user's background information and speaking style. Secondly, we employ reinforcement learning techniques to maximize future reward in dialogue, which enables our system to generate topic-coherent, informative and grammatical responses. Moreover, we propose three types of rewards to characterize good conversations. Finally, we compare the performance of the following reinforcement learning methods in dialogue generation: policy gradient, Q-learning, and actor-critic algorithms. We conduct experiments to verify the effectiveness of the proposed model on two dialogue datasets. Experimental results demonstrate that our model can generate better personalized dialogues for different users. Quantitatively, our method achieves better performance than the state-of-the-art dialogue systems in terms of BLEU score, perplexity, and human evaluation.

In this paper, we propose a novel personalized response generation model via domain adaptation (PRG-DM). First, we learn the human responding style from large general data (without user-specific information). Second, we fine tune the model on a small size of personalized data to generate personalized responses with a dual learning mechanism. Moreover, we propose three new rewards to characterize good conversations that are personalized, informative and grammatical. We employ the policy gradient method to generate highly rewarded responses. Experimental results show that our model can generate better personalized responses for different users.

News recommendation recently has attracted wide spread research attention because of the fast propagation of information on the Internet. Due to the large volume of information, a recommendation system which can provide the most important and useful information is required. Most of existing researches focus on providing recommendation based on news contents and predict the category of news only, which is inefficient if the news pool is very large or contains a lot of noisy data. In this study, we propose a novel news recommendation system called UBS, which recommends personalized news based on User Behavior Sequence (UBS) with high efficiency. We formulate the mining problem of user behavior sequence for Internet news reading, which can significantly enhance the performance of recommendation. Experimental validation was conducted using real datasets that obtained from news website. The results show that UBS can provide reasonable news recommendation compared to content-based recommendation as well as collaborative filtering.

Web Harvesting enables the enrichment of incomplete data sets by retrieving required information from the Web. However, the ambiguity of instances may greatly decrease the quality of the harvested data, given that any instance in the local data set may become ambiguous when attempting to identify it on the Web. Although plenty of disambiguation methods have been proposed to deal with the ambiguity problems in various settings, none of them are able to handle the instance ambiguity problem in Web Harvesting. In this paper, we propose to do instance disambiguation in Web Harvesting with a novel disambiguation method inspired by the idea of collaborative identity recognition. In particular, we expect to find some common properties in forms of latent shared attribute values among instances in the list, such that these shared attribute values can differentiate instances within the list against those ambiguous ones on the Web. Our extensive experimental evaluation illustrates the utility of collaborative disambiguation for a popular Web Harvesting application, and shows that it substantially improves the accuracy of the harvested data.

Piecewise Linear Representation (PLR) has been a widely used method for approximating data streams in the form of compact line segments. The buffer-based approach to PLR enables a semi-global approximation which relies on the aggregated processing of batches of streamed data so that to adjust and improve the approximation results. However, one challenge towards applying the buffer-based approach is allocating the necessary memory resources for stream buffering. This challenge is further complicated in a multi-stream environment where multiple data streams are competing for the available memory resources, especially in resource-constrained systems such as sensors and mobile devices.

Entity resolution (ER) is a problem that arises in many areas. In most of cases, it represents a task that multiple entities from different sources require to be identified if they refer to the same or different objects because there are not unique identifiers associated with them. In this paper, we propose a model using web pages identification to identify entities and merge those entities refer to one object together. We use a classical name disambiguation problem as case study and examine our model on a subset of digital library records as the first stage of our work. The favorable results indicated that our proposed approach is highly effective. © 2010 Copyright is held by the author/owner(s).