User sequential behaviors are driven by a variety of complex and evolving intents. Capturing the dynamic change of user intents has become critical yet challenging in the next-item recommendation. Existing studies usually model the transition relationships among multiple intents within a session or integrate temporal information to capture the dynamic evolution of user intents. However, they struggle to identify the precise timing and magnitudes of intent changes, leading to ambiguity in providing consistent or violated recommendations and ultimately yielding subpar performance. To this end, we propose a novel framework called Dual Fluctuation Modeling of Multi-level Intent Evolution for Next-Item Recommendation (DFRec) in this paper. DFRec explicitly identifies the user intent changes and further quantifies the magnitude of the changes. Specifically, we assume that a user's intent fluctuates around an inherent intent, with the magnitude of fluctuations indicating the extent of changes in user intents. Thus, we design an Emerging Intent Generation Module that employs a normal distribution with dynamic variance to capture intent fluctuations at each time step. Furthermore, we introduce a dual-layer dynamic variance update mechanism to capture fluctuation characteristics at different temporal levels, enhancing the representation of possible emergent intents. Extensive experiments on three real-world datasets verify DFRec's superiority over state-of-the-art baselines.

Jianqi Gao, Hang Yu, Jian Cao, Ranran Bu, Jinghua Tang, Nengjun Zhu, Yonggang Zhang. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.

Graph Anomaly Detection (GAD) plays a vital role in various data mining applications such as e-commerce fraud prevention and malicious user detection. Recently, Graph Neural Network (GNN) -based approach has demonstrated great effectiveness in GAD by first encoding graph data into low-dimensional representations and then identifying anomalies under the guidance of supervised or unsupervised signals. However, existing GNN-based approaches implicitly follow the homophily principle (i.e., the “like attracts like” phenomenon) and fail to learn discriminative embedding for anomalies that connect vast normal nodes. Moreover, such approaches identify anomalies in a unified global perspective but overlook diversified abnormal patterns conditioned on local graph context, leading to suboptimal performance. To overcome the aforementioned limitations, in this article, we propose a Multi-hypersphere Heterophilic Graph Learning (MHetGL) framework for unsupervised GAD. Specifically, we first devise a Heterophilic Graph Encoding (HGE) module to learn distinguishable representations for potential anomalies by purifying and augmenting their neighborhood in a fully unsupervised manner. Then, we propose a Multi-Hypersphere Learning module to enhance the detection capability for context-dependent anomalies by jointly incorporating critical patterns from both global and local perspectives. Extensive experiments on 11 real-world datasets show that MHetGL outperforms 26 baselines. Our code is publicly available at https://github.com/KennyNH/MHetGL .

In modern cities, there is an increasing trend for the development of business agglomeration, which can foster the prosperity of individual businesses by clustering stores and industries. Recently, the advent of Point-of-Interest (POI) data enables a new paradigm for studying the causal effect of business agglomeration in a data-driven way. To this end, we aim to quantify the contribution of the agglomeration effect to the check-in volume at POIs. This is a non-trivial causal effect estimation task due to the higher-order spatial interference typically exhibited by the agglomeration distribution. Moreover, the confounding bias can be exacerbated due to the complex spatial and functional properties inherent to confounders. Therefore, we propose a Causal effect estimation framework for AgglomeRation Effect (CARE) measurement, which includes a Spatial Interference Diffusion Network (SIDN) and a Disentangled Propensity Estimator (DPE) . SIDN captures spatial interference by spreading the treatment effect among POIs through a dedicated spatial agglomeration hypergraph. Then, DPE models a POI’s propensity of receiving the treatment and further unravels the spatial and inherent aspects of propensity by disentangled learning objectives. In addition, we incorporate SIDN and DPE into a unified causal effect estimation architecture using neural Robinson decomposition. Finally, extensive experiments on three real-world datasets validate the effectiveness and universality of CARE for measuring the agglomeration effect.

Knowledge base question answering (KBQA) refers to the system that produces answers to user queries by reasoning with a large-scale structured knowledge base. Advanced works have achieved great success either by generating logical forms (LF) or directly generating answers. Although the former typically yields better performance, these generated LF could be inaccurate, e.g., non-executable. In this regard, large language models (LLMs) have shown exciting potential for accurate generation. However, it is challenging to fine-tune LLMs to generate LF. This is because the context retrieved for prediction typically leads to an excessive number of reasoning paths. In this context, LLMs can generate numerous LF corresponding to these reasoning paths, but a few LF can result in correct answers. Thus, fine-tuning LLMs to generate answer-relevant LF would conflict with the prior knowledge of the LLMs. In this work, we propose a novel learning framework, FM-KBQA, to fine-tune LLMs using multi-task learning for KBQA. Specifically, we propose to fine-tune LLMs using an additional objective: generating the index of reasoning paths that lead to correct answers. This will direct LLMs to pay attention to answer-relevant paths among numerous reasoning paths by completing a simple task where the selected reasoning paths can be supplementary for non-executable LF. Directly generating answers can make LLMs pay attention to the answer-relevant reasoning paths, but it is much more challenging than generating the index of reasoning paths. To verify FM-KBQA's effectiveness, we conduct experiments on mainstream benchmarks, such as WebQuestionsSP (WQSP) and ComplexWebQuestions (CWQ). Extensive evaluations across two public benchmark datasets underscore the superiority of FM-KBQA over current state-of-the-art methods.

The end-to-end automated design of machine learning (ML) pipelines significantly reduces the workload for data scientists and democratizes ML for non-experts. Evolutionary algorithm (EA)-based automated ML (AutoML) systems, a prominent category of AutoML, often face inefficiencies due to the costly fitness evaluation of candidate ML pipelines. Although surrogate models have been employed to approximate the true performance of pipelines more quickly, a key challenge remains in effectively bridging the semantic gap between the heterogeneous features of datasets and pipelines. To address this issue, we propose ADELA, a novel accompanying surrogate-based optimization strategy that accelerates EA-based AutoML while retaining the performance of the resulting pipelines. ADELA operates in two phases: Offline, leveraging a high-quality curated pipeline corpus to meta-learn an accompanying surrogate model; and Online, selecting the accompanying pipeline and using the learned model to predict the performance of evaluation pipelines instead of executing them. The accompanying mechanism effectively mitigates the semantic gap between datasets and pipelines, enabling ADELA to reduce computation times by an average of 73.66% while retaining 98.78% of the final pipeline performance, as demonstrated in extensive experimental evaluations.

When processing multi-view data, conflicts may occur since different views have unique insights. Existing studies always consider conflict as a bad factor and thus adopt a negative operation, i.e., eliminating or minimizing conflicts. However, in a multi-view decision-making scenario, conflict can highlight view differences and reveal the reliability of individual and collective decisions. To this end, we propose a novel trusted collective learning method (TrustCL) that can actively handle conflicts between individuals and obtain a collective opinion and its reliability by considering conflicts. Specifically, TrustCL first learns view-specific evidence supporting individual opinions. To deal with conflicting opinions across views, TrustCL assembles a reliability-oriented collective learning phase to determine which view owns a higher priority. It further combines priority and view-specific evidence to conclude the final collective opinion and its reliability. Experiments on a real-world multidisciplinary consultation dataset demonstrate the superiority of our method and exhibit some interesting findings regarding conflictive multi-view decision-making. Our code is available at https://github.com/ifbettrer/TrustCL

With the explosive growth of online information, recommendation systems have become essential tools for alleviating information overload. In recent years, researchers have increasingly focused on centralized recommendation systems, capitalizing on the powerful computing capabilities of cloud servers and the rich historical data they store. However, the rapid development of edge computing and mobile devices in recent years has provided new alternatives for building recommendation systems. These alternatives offer advantages such as privacy protection and low-latency recommendations. To leverage the advantages of different computing nodes, including cloud servers, edge servers, and terminal devices, researchers have proposed recommendation systems that involve the collaboration of these nodes, known as distributed recommendation systems. This survey provides a systematic review of distributed recommendation systems. Specifically, we design a taxonomy for these systems from four perspectives and comprehensively summarize each study by category. In particular, we conduct a detailed analysis of the collaboration mechanisms of distributed recommendation systems. Finally, we discuss potential future research directions in this field.

Among various disasters, fire poses one of the most widespread threats to public safety. The early stage of fire, marked by small and slow-spreading fire objects, is the ideal time for firefighting intervention. Therefore, early fire detection is crucial to prevent potential hazards and reduce loss of life and property. However, due to the variable shapes and small size, existing methods struggle to precisely locate smoke and flame in the initial stage. Compared to rigid objects, flame has unique local morphology, such as sharp tip, irregular edge and cavity. These prior knowledge could guide the model to focus on the local morphological features of the flame, thereby improving early fire detection ability. To address the current challenges, the paper proposes a Local Morphological Knowledge Matching based Early Fire Detector(LMKMFD), which accurately detects early fires and locates the multi-scale fires by exploring local flame morphology in fire images. Firstly, the local morphological features are extracted by matching the input fire image with the knowledge templates of the designed local morphological knowledge base. Secondly, fire multi-scale semantic features at four scales are mined by a Transformer-based backbone. Finally, fire local morphological features and multi-scale semantic features are aggregated by single-level depth prediction module to achieve region-level localization of fire objects. Experimental results on private and public datasets show that LMKMFD exhibits high detection precision for fires of different scales, particularly small early fires. LMKMFD outperforms baseline models, with mean Average Precision(mAP) of 88.38% and 83.12% on two datasets. Notably, due to the significance of local morphology of flame, the method performs better in detecting flame than smoke.

Recent trends in next-item recommendation systems have focused on modeling user intents. Traditional methods often extract users' inherent intents from the most representative items in a session, overlooking “unexpected items” that deviate from the majority in various contextual aspects. These unexpected items, frequently present, can be crucial indicators of a user's inclination towards exploring new options, signaling emerging intents that warrant significant attention. In response, we introduce DbMei, a novel approach that decouples user behaviors and emphasizes the modeling of emerging intents. DbMei distinguishes between two user behavior types: “focused shopping”, which aligns with users' inherent intents, and”wandering shopping”, which aligns with emerging intents. Focused shopping is analyzed using topic modeling and hypergraph learning while wandering shopping is explored through session neighbor retrieval. An exploitation-exploration mechanism is employed to determine the behavioral probability distribution for upcoming items. This integrated modeling of focused and wandering shopping behaviors drives our recommendation process. Extensive empirical studies on two real-world datasets, Amazon-KDD and Beauty, showcase DbMei's superiority over leading methods regarding Recall and MRR metrics. Our code is publicly available at https://github.com/sunlingdan-123/DbMei.

It is time-consuming and knowledge-intensive for scientists to find practical workflows from the massive number of scientific workflow models. Currently, the retrieval approaches are mainly based on text matching between natural language queries and the descriptions of candidate workflows. Notably, the workflow structure also provides essential semantics, but the challenge lies in effectively matching these two pieces of heterogeneous information. To address this issue, we propose a Proxy-based Scientific workflow retrieval approach, ProSwats, which selects a workflow as the Proxy for each text query to bridge the gap between textual and structural semantics. ProSwats consists of two stages: workflow pre-selection based on text similarity and workflow ranking based on a matching degree prediction model. The textual and structural features are integrated by the proxy in this model, which is used to predict and rank the degree of semantic matching between the user query and candidate workflows. Crucially, ProSwats incorporates a confidence-aware learning mechanism to adapt to the varying reliability of proxies, enhancing generalizability. Extensive experimental results on two real-world datasets demonstrate that ProSwats outperforms state-of-the-art methods with statistical significance.

Interpretable and robust medical diagnoses are essential traits for practicing clinicians. Most computer-augmented diagnostic systems suffer from three major problems: non-interpretability, limited modality analysis, and narrow focus. Existing frameworks can either deal with multimodality to some extent but suffer from non-interpretability or partially interpretable but provide a limited modality and multifaceted capabilities. Our work aims to integrate all these aspects in one complete framework to fully utilize the full spectrum of information offered by multiple modalities and facets. We propose our solution via our novel architecture VR-DiagNet, consisting of a planner and a classifier, optimized iteratively and cohesively. VR-DiagNet simulates the perceptual process of clinicians via the use of volumetric imaging information integrated with radiomic features modality; at the same time, it recreates human thought processes via a customized Monte Carlo Tree Search (MCTS) which constructs a volume-tailored experience tree to identify slices of interest (SoIs) in our multi-slice perception space. We conducted extensive experiments across two diagnostic tasks comprising six public medical volumetric benchmark datasets. Our findings showcase superior performance, as evidenced by heightened accuracy and area under the curve (AUC) metrics, reduced computational overhead, and expedited convergence while conclusively illustrating the immense value of integrating volumetric and radiomic modalities for our current problem setup.

Summary Finding similar scientific workflow modules that can substitute essential components of the privacy workflows from public repositories to create a personalized workflow is growing in popularity. This is a cost‐effective and error‐free strategy for the scientific community. Currently, module alignment approaches heavily depend on syntactic information such as modules' names and types. However, the contextual semantic information of modules, which encompasses inputs, outputs, and datalinks connecting modules, can also convey their functions. Unfortunately, this information is scarcely utilized during the module alignment process. In this work, we propose a module alignment method based on neighbor information for scientific workflow (MANSOR). Specifically, we present a rule‐based attribute similarity computation approach for calculating initial module‐pair similarity in two workflows. The relation similarity is then employed to iteratively fine‐tune the matching degree with uncertainty of module pairs by considering the contextual semantics until reaching a steady state. After pairwise comparison of workflows, the module alignment results are determined based on their module‐pair similarity. Experimental results on the human‐curated corpus of ratings indicate that MANSOR outperforms the existing state‐of‐the‐art approaches with statistical significance.

Recent years have witnessed the fast development of deep learning techniques in quantitative trading. It still remains unclear how to exploit deep learning techniques to improve high-frequency trading (HFT). Indeed, there are two emerging challenges for the use of deep learning for HFT: (i) how to quantify fast-changing market conditions for tick-level signal prediction; (ii) how to establish a unified trading paradigm for different securities of diverse market conditions and severe signal sparsity. To this end, in this paper, we propose anOnlineAdaptive Sequence Learning(LEVER) framework, which consists of two distinct components to predict the HFT signals at the tick level for a variety of securities simultaneously. Specifically, we start with a single learner that adopts an encoder-decoder architecture for each security-based HFT signal prediction. In this single learner, an ordered encoder module first captures the variability patterns of the security's price curve by encoding the input indicator sequence from different time ranges. An unordered decoder module then outlines the pivot points of the price curve as support and resistance levels to quantify the market status. Based on the measured market condition, a prediction module further approximates the impacts of upcoming security data as the potential market momentum to detect the tick-level trading signals. To overcome the computational challenges and signal sparsity posed by online HFT for multiple securities, we develop a competitive active-meta learning paradigm to enhance the signal learners’ learning efficiency for online implementation. Finally, extensive experiments on real-world stock market data demonstrate the effectiveness of our deployed LEVER for improving the performances of the existing industry method by 0.27 in the Sharpe ratio and by 0.09% in a transaction-based return.

While significant progress has been made in recognizing entities from plain text, the exploration of entity recognition from multimodal data remains limited due to disparities in semantic representation. In light of this challenge, given the supportive nature of visual and text data, we propose a novel entity recognition model called Heterogeneous Graph Reasoning(HGR), leveraging the synergistic nature of visual and textual data. This is achieved through the utilization of the Vision Refine and Graph Cross Inference modules. In the Vision Refine module, semantically relevant objects hidden in the image are selected to aid in the text entity extraction. In the Graph Cross Inference module, cross-association inference between visual regions and textual entities is constructed through graph construction, heterogeneous graph fusion, visual region refinement and cross inference. Extensive experiments on four multimodal datasets are demonstrate the superiority of our model, when compared to the second-best state-of-the-art model.

Medical tests are crucial for treatment decision making. However, over-testing can often occur in any medical speciality or level of expertise. Since over-testing usually results in a financial burden for patients and is also a waste of medical resources, this naturally leads to the question: which medical test items (MTIs) are necessary and should be prioritized for the target patients? It is a nontrivial task to identify the right MTIs due to the diversified health status of patients and the complicated prerequisites of therapies. To this end, in this paper, we propose a data-driven approach to evaluate the priority which should be given to MTIs by modeling the relationships between MTIs and therapies. Specifically, we first develop a dual hierarchical topic model (DHTM), which views the adopted hierarchical therapies as labeled topics and the MTI reports, i.e., the set of hierarchical attribute-value pairs (AVPs), as documents. Then, with the therapy-AVP distribution and the partial MTI reports of the target patient, we can scope the candidate therapies, which are further utilized to evaluate the accumulated gain of MTIs to be tested. Moreover, the next MTI recommendation is conducted based on the gains. Finally, extensive experiments on real-world medical data validate the effectiveness of our approach, and some interesting observations are also provided. The code is available at https://github.com/mtirec/MtiRec.

A session-based recommendation system (SRS) tries to predict the next possible choice of anonymous users. In recent years, graph neural network (GNN) models have been successfully applied to SRSs and have achieved great success. Using GNN models in SRSs, each session graph is processed successively to obtain the embedding of the node (i.e, each action on an item), which is then imported into the prediction module to generate recommendation results. However, solely depending on the session graph to obtain the node embeddings is not sufficient because each session only involves a few items. Therefore, neighbor sessions have been used to extend the session graph to learn more informative node representations. In this paper, we introduce a S ession-based recommendation MO del based on N eighbor sessions with similar probabilistic int E ntions(SMONE). SMONE models the intentions behind sessions in a probabilistic way and retrieves the neighbor sessions with similar intentions. After the neighbor sessions are found, the target session and its neighbor sessions are modeled as a hypyergraph to learn the contextualized embeddings, which are combined with item embeddings through GNN to produce the final item recommendations. Experiments on real-world datasets prove the effectiveness and superiority of SMONE.

Pre-travel out-of-town recommendation aims to recommend Point-of-Interests (POIs) to the users who plan to travel out of their hometown in the near future yet have not decided where to go, i.e., their destination regions and POIs both remain unknown. It is a non-trivial task since the searching space is vast, which may lead to distinct travel experiences in different out-of-town regions and eventually confuse decision-making. Besides, users' out-of-town travel behaviors are affected not only by their personalized preferences but heavily by others' travel behaviors. To this end, we propose a Crowd-Aware Pre-Travel Out-of-town Recommendation framework (CAPTOR) consisting of two major modules: spatial-affined conditional random field (SA-CRF) and crowd behavior memory network (CBMN). Specifically, SA-CRF captures the spatial affinity among POIs while preserving the inherent information of POIs. Then, CBMN is proposed to maintain the crowd travel behaviors w.r.t. each region through three affiliated blocks reading and writing the memory adaptively. We devise the elaborated metric space with a dynamic mapping mechanism, where the users and POIs are distinguishable both inherently and geographically. Extensive experiments on two real-world nationwide datasets validate the effectiveness of CAPTOR against the pre-travel out-of-town recommendation task.

The understanding of people’s inter-regional mobility behaviors, such as predicting the next activity region (AR) or uncovering the intentions for regional mobility, is of great value to public administration or business interests. While there are numerous studies on human mobility, these studies are mainly from a statistical view or study movement behaviors within a region. The work on individual-level inter-regional mobility behavior is limited. To this end, in this article, we propose a dynamic region-relation-aware graph neural network (DRRGNN) for exploring individual mobility behaviors over ARs. Specifically, we aim at developing models that can answer three questions: (1) Which regions are the ARs? (2) Which region will be the next AR, and (3) Why do people make this regional mobility? To achieve these tasks, we first propose a method to find out people’s ARs. Then, the designed model integrates a dynamic graph convolution network (DGCN) and a recurrent neural network (RNN) to depict the evolution of relations between ARs and mine the regional mobility patterns. In the learning process, the model further considers peoples’ profiles and visited point-of-interest (POIs). Finally, extensive experiments on two real-world datasets show that the proposed model can significantly improve accuracy for both the next AR prediction and mobility intention prediction.

A session-based recommender system (SBRS) captures users’ evolving behaviors and recommends the next item by profiling users in terms of items in a session. User intent and user preference are two factors affecting his (her) decisions. Specifically, the former narrows the selection scope to some item types, while the latter helps to compare items of the same type. Most SBRSs assume one arbitrary user intent dominates a session when making a recommendation. However, this oversimplifies the reality that a session may involve multiple types of items conforming to different intents. In current SBRSs, items conforming to different user intents have cross-interference in profiling users for whom only one user intent is considered. Explicitly identifying and differentiating items conforming to various user intents can address this issue and model rich contextual information of a session. To this end, we design a framework modeling user intent and preference explicitly, which empowers the two factors to play their distinctive roles. Accordingly, we propose a key-array memory network (KA-MemNN) with a hierarchical intent tree to model coarse-to-fine user intents. The two-layer weighting unit (TLWU) in KA-MemNN detects user intents and generates intent-specific user profiles. Furthermore, the hierarchical semantic component (HSC) integrates multiple sets of intent-specific user profiles along with different user intent distributions to model a multi-intent user profile. The experimental results on real-world datasets demonstrate the superiority of KA-MemNN over selected state-of-the-art methods.

k-nearest neighbors algorithm ( k-NN) is a simple yet powerful method that can predict an unlabeled object using the k closest samples whose labels are already known. However, in some cases such as medical treatment decision making, multiple experts can provide their individual decisions and there is no single ground truth for the labels of samples. As a result, the accuracy of the predictions can be affected by the uncertainties of historical decisions. In order to learn from uncertain decisions from multiple experts, we propose a new k-NN algorithm. This algorithm firstly measures the uncertainties of labels. Then, the prediction is made based on the uncertain labels of the k closest samples based on the Dempster-Shafer theory. We also introduce two methods to compute the optimal k value. Experiments on a real-world medical treatment dataset prove that our algorithm has better performance compared with other algorithms.

Cross-domain recommendation can alleviate data sparsity problems by leveraging data from multiple domains. Hence it is becoming an emerging research topic. Existing approaches based on latent factor models usually attempt to utilize cross-domain information in the form of inner product or Euclidean distance. This kind of form only enables the model to incorporate non-structure similarity relations between entities. However, the studies in the literature of consumer behavior have disclosed that consumers make decisions following a structural characteristic. Inspired by this, we propose a new cross-domain recommendation model, named PSRec, which learns and shares users' inherent preference structure information during their decision making in relation to their product choices in different domains. In PSRec, the latent factors of items of different domains are mapped to a common space so that the factorized user latent vectors have similar preference structures. Moreover, users' preference structure information is transferred from an auxiliary domain to a target domain as a constraint to a non-negative matrix factorization algorithm. Extensive experiments on two real-world datasets demonstrate the effectiveness and competitive performance of PSRec compared to several state-of-the-art solutions.

In location-based services, such as navigation and ride-hailing, it is an essential function to match a query with Point-of-Interests (POIs) for efficient destination retrieval. Indeed, due to the space limit and real-time requirement, such services usually require intermediate POI matching results when only partial search keywords are typed. While there are numerous retrieval models for general textual semantic matching, few attempts have been made for query-POI matching by considering the integration of rich spatio-temporal factors and dynamic user preferences. To this end, in this paper, we develop a spatio-temporal dual graph attention network ~(STDGAT), which can jointly model dynamic situational context and users' sequential behaviors for intelligent query-POI matching. Specifically, we first utilize a semantic representation block to model semantic correlations among incomplete texts as well as various spatio-temporal factors captured by location and time. Next, we propose a novel dual graph attention network to capture two types of query-POI relevance, where one models global query-POI interaction and another one models time-evolving user preferences on destination POIs. Moreover, we also incorporate spatio-temporal factors into the dual graph attention network so that the query-POI relevance can be generalized to the sophisticated situational context. After that, a pairwise fusion strategy is introduced to extract the salient global feature representatives for both queries and POIs. Finally, several cold-start strategies and training methods are proposed to improve the matching effectiveness and training efficiency. Extensive experiments on two real-world datasets demonstrate the performances of our approach compared with state-of-the-art baselines. The results show that our model achieves significant improvement in terms of matching accuracy even with only partial query keywords are given.

The next-item recommendation has attracted great research interests with both static and dynamic users' preferences considered. Existing approaches typically utilize user-item binary relations, and assume a flat preference distribution over items for each user. However, this assumption neglects the hierarchical discrimination between user intentions and user preferences, causing the methods have limited capacity to depict intention-specific preference. In fact, a consumer's purchasing behavior involves a natural sequential process, i.e., he/she first has an intention to buy one type of items, followed by choosing a specific item according to his/her preference under this intention. To this end, we propose a novel key-array memory network (KA-MemNN), which takes both user intentions and preferences into account for next-item recommendation. Specifically, the user behavioral intention tendency is determined through key addressing. Further, each array outputs an intention-specific preference representation of a user. Then, the degree of user's behavioral intention tendency and intention-specific preference representation are combined to form a hierarchical representation of a user. This representation is further utilized to replace the static profile of users in traditional matrix factorization for the purposes of reasoning. The experimental results on real-world data demonstrate the advantages of our approach over state-of-the-art methods.

Recent years have witnessed an emerging trend for improving disease treatment by forming multi-disciplinary medical teams. The collaboration among specialists from multiple medical domains has been shown to be significantly helpful for designing comprehensive and reliable regimens, especially for incurable diseases. Although this kind of multi-disciplinary treatment has been increasingly adopted by healthcare providers, a new challenge has been introduced to the decision-making process—how to efficiently and effectively develop final regimens by searching for candidate treatments and considering inputs from every expert. In this article, we present a sophisticated decision support system called MdtDSS (a decision support system (DSS) for multi-disciplinary treatment (Mdt)), which is particularly developed to guide the collaborative decision-making in multi-disciplinary treatment scenarios. The system integrates a recommender system that aims to search for personalized candidates from a large-scale high-quality regimen pool and a voting system that helps collect feedback from multiple specialists without potential bias. Our decision support system optimally combines machine intelligence and human experience and helps medical practitioners make informed and accountable regimen decisions. We deployed the proposed system in a large hospital in Shanghai, China, and collected real-world data on large-scale patient cases. The evaluation shows that the proposed system achieves outstanding results in terms of high-quality multi-disciplinary treatment.

With the number of smartphone applications (apps) growing explosively, it has a practical significance to provide personalized app recommendations. In this paper, we propose the GTRM, a new recommendation model which builds the top-N app list by optimizing the metric Group-oriented Mean Average Precision (GMAP). GMAP is an extension of the traditional metric Mean Average Precision (MAP) and it measures the precisions of top-N list in terms of the collective positions of related items rather than the position of individual item. Therefore, GTRM can recommend a more reasonable top-N app list by avoiding overfitting problem. The details of GMAP and GTRM are described. Extensive experiments on a real-world app dataset demonstrate the effectiveness of GTRM, and show that GTRM significantly outperforms the compared methods.