Browse
Submit Data
Databases
API
Help

Dataset Information

7 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

LightFIG: simplifying and powering feature interactions via graph for recommendation.

ABSTRACT: The attributes of users and items contain key information for recommendation. The latest advances demonstrate that better representations can be learned by performing graph convolutions on attribute graph of the user-item pair. Recently proposed models construct graphs that not only connect edges between user attributes and item attributes, but also within user (item) attributes. However, to determine whether a user is interested in an item, the relationships between user attributes and item attributes are what we really need to mine. In many cases, due to the low correlation between relationships within user (item) attributes and preference of the user, the artificially connected edges within user (item) attributes contribute little to the recommendation. Even worse, including them will not only drastically increase the training time, but may also introduce noise and lead to degraded performance. In addition, the use of the optimizer is also relatively simple. One single optimizer is the default configuration for recommendation models. This may not be the best way to exploit it in many cases however. To solve these problems, we propose an enhanced model named LightFIG in this work. The key idea of LightFIG is twofold: First, we simplify the construction of attribute graph which focuses on mining relationships cross user attributes and item attributes, not between user (item) attributes. Second, we propose the idea of relay optimization, which employs two different optimizers to continuously optimize model parameters. Comprehensive experiments on three public datasets demonstrate the effectiveness of our proposed model.

SUBMITTER: Di W

PROVIDER: S-EPMC9299275 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Optimization of mine ventilation network feature graph.

Project description:A ventilation network feature graph can directly and quantitatively represent the features of a ventilation network. To ensure the stability of airflow in a mine and improve ventilation system analysis, we propose a new algorithm to draw ventilation network feature graphs. The independent path method serves as the algorithm's main frame, and an improved adaptive genetic algorithm is embedded so that the graph may be drawn better. A mathematical model based on the node adjacency matrix method for unidirectional circuit discrimination is constructed as the drawing algorithm may not be valid in such cases. By modifying the edge-seeking strategy, the improved depth-first search algorithm can be used to determine all of the paths in the ventilation network with unidirectional circuits, and the equivalent transformation method of network topology relations is used to draw the ventilation network feature graph. Through the analysis of the topological relation of a ventilation network, a simplified mathematical model is constructed, and network simplification technology makes the drawing concise and hierarchical. The rapid and intuitive drawing of the ventilation network feature graphs is significant for optimization of the ventilation system and day-to-day management.

| S-EPMC7668600 | biostudies-literature

Research on cloud manufacturing service recommendation based on graph neural network.

Project description:There are an increasing number of manufacturing service resources appeared on the cloud manufacturing (CMfg) service platform recently, which leads to a serious information overloading problem to the enterprises that need these resources. To tackle this problem, a graph neural network-based recommendation method for CMfg service resources is proposed, which effectively overcomes some limitations of the traditional recommendation methods. Specifically, we first use different similarity calculation methods (e.g., Cosine similarity, Pearson correlation coefficient, etc.) to calculate the similarities between different resources based on the feature information of CMfg service resources. A resource graph dataset is accordingly established. A graph neural network is then used to perform representation learning of nodes in these graphs, obtaining the vector representations of these nodes. Finally, new links that may appear in a graph are predicted by performing dot product calculations on these nodes' vector representations. And these links can be used to recommend suitable resources. Experiments mainly show that (i) the proposed method obtains better link prediction accuracy compared with that of other link prediction algorithms; (ii) when the network density used for training is relatively high, the predictive performance of the proposed method is improved significantly. Our method can shed light on how to choose suitable CMfg service resources from the CMfg service platform.

| S-EPMC10522046 | biostudies-literature

Self-supervised global context graph neural network for session-based recommendation.

Project description:Session-based recommendation (SBR) aims to recommend the next items based on anonymous behavior sequences over a short period of time. Compared with other recommendation paradigms, the information available in SBR is very limited. Therefore, capturing the item relations across sessions is crucial for SBR. Recently, many methods have been proposed to learn article transformation relationships over all sessions. Despite their success, these methods may enlarge the impact of noisy interactions and ignore the complex high-order relationship between non-adjacent items. In this study, we propose a self-supervised global context graph neural network (SGC-GNN) to model high-order transition relations between items over all sessions by using virtual context vectors, each of which connects to all items in a given session and enables to collect and propagation information beyond adjacent items. Moreover, to improve the robustness of the proposed model, we devise a contrastive self-supervised learning (SSL) module as an auxiliary task to jointly learn more robust representations of the items in sessions and train the model to fulfill the SBR task. Experimental results on three benchmark datasets demonstrate the superiority of our model over the state-of-the-art (SOTA) methods and validate the effectiveness of context vectors and the self-supervised module.

| S-EPMC9454781 | biostudies-literature

Enhancing neural collaborative filtering using hybrid feature selection for recommendation.

Project description:The past decade has seen substantial growth in online transactions. Accordingly, many professionals and researchers utilize deep learning models to design and develop recommender systems to suit the needs of online personal services. These systems can model the interactions between users and items. However, existing approaches focus on either modeling global or local item correlation and rarely consider both cases, thus failing to represent user-item correlation very well. Therefore, this article proposes a deep collaborative recommendation system based on a convolutional neural network with an outer product matrix and a hybrid feature selection module to capture local and global higher-order interaction between users and items. Moreover, we incorporated the weights of generalized matrix factorization to optimize the overall network performance and prevent overfitting. Finally, we conducted extensive experiments on two real-world datasets with different sparsity to confirm that our proposed approach outperforms the baseline methods we have used in the experiment.

| S-EPMC10496003 | biostudies-literature

Graph-Based Feature Selection Approach for Molecular Activity Prediction.

Project description:In the construction of QSAR models for the prediction of molecular activity, feature selection is a common task aimed at improving the results and understanding of the problem. The selection of features allows elimination of irrelevant and redundant features, reduces the effect of dimensionality problems, and improves the generalization and interpretability of the models. In many feature selection applications, such as those based on ensembles of feature selectors, it is necessary to combine different selection processes. In this work, we evaluate the application of a new feature selection approach to the prediction of molecular activity, based on the construction of an undirected graph to combine base feature selectors. The experimental results demonstrate the efficiency of the graph-based method in terms of the classification performance, reduction, and redundancy compared to the standard voting method. The graph-based method can be extended to different feature selection algorithms and applied to other cheminformatics problems.

| S-EPMC9006223 | biostudies-literature

forgeNet: a graph deep neural network model using tree-based ensemble classifiers for feature graph construction.

Project description:MotivationA unique challenge in predictive model building for omics data has been the small number of samples (n) versus the large amount of features (p). This 'n≪p' property brings difficulties for disease outcome classification using deep learning techniques. Sparse learning by incorporating known functional relationships between the biological units, such as the graph-embedded deep feedforward network (GEDFN) model, has been a solution to this issue. However, such methods require an existing feature graph, and potential mis-specification of the feature graph can be harmful on classification and feature selection.ResultsTo address this limitation and develop a robust classification model without relying on external knowledge, we propose a forest graph-embedded deep feedforward network (forgeNet) model, to integrate the GEDFN architecture with a forest feature graph extractor, so that the feature graph can be learned in a supervised manner and specifically constructed for a given prediction task. To validate the method's capability, we experimented the forgeNet model with both synthetic and real datasets. The resulting high classification accuracy suggests that the method is a valuable addition to sparse deep learning models for omics data.Availability and implementationThe method is available at https://github.com/yunchuankong/forgeNet.Contacttianwei.yu@emory.edu.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC7267822 | biostudies-literature

A unified drug-target interaction prediction framework based on knowledge graph and recommendation system.

Project description:Prediction of drug-target interactions (DTI) plays a vital role in drug development in various areas, such as virtual screening, drug repurposing and identification of potential drug side effects. Despite extensive efforts have been invested in perfecting DTI prediction, existing methods still suffer from the high sparsity of DTI datasets and the cold start problem. Here, we develop KGE_NFM, a unified framework for DTI prediction by combining knowledge graph (KG) and recommendation system. This framework firstly learns a low-dimensional representation for various entities in the KG, and then integrates the multimodal information via neural factorization machine (NFM). KGE_NFM is evaluated under three realistic scenarios, and achieves accurate and robust predictions on four benchmark datasets, especially in the scenario of the cold start for proteins. Our results indicate that KGE_NFM provides valuable insight to integrate KG and recommendation system-based techniques into a unified framework for novel DTI discovery.

| S-EPMC8635420 | biostudies-literature

User abnormal behavior recommendation via multilayer network.

Project description:With the growing popularity of online services such as online banking and online shopping, one of the essential research topics is how to build a privacy-preserving user abnormal behavior recommendation system. However, a machine-learning based system may present a dilemma. On one aspect, such system requires large volume of features to pre-train the model, but on another aspect, it is challenging to design usable features without looking to plaintext private data. In this paper, we propose an unorthodox approach involving graph analysis to resolve this dilemma and build a novel private-preserving recommendation system under a multilayer network framework. In experiments, we use a large, state-of-the-art dataset (containing more than 40,000 nodes and 43 million encrypted features) to evaluate the recommendation ability of our system on abnormal user behavior, yielding an overall precision rate of around 0.9, a recall rate of 1.0, and an F1-score of around 0.94. Also, we have also reported a linear time complexity for our system. Last, we deploy our system on the "Wenjuanxing" crowd-sourced system and "Amazon Mechanical Turk" for other users to evaluate in all aspects. The result shows that almost all feedbacks have achieved up to 85% satisfaction.

| S-EPMC6890179 | biostudies-literature

A directed acyclic graph for interactions.

Project description:BackgroundDirected acyclic graphs (DAGs) are of great help when researchers try to understand the nature of causal relationships and the consequences of conditioning on different variables. One fundamental feature of causal relations that has not been incorporated into the standard DAG framework is interaction, i.e. when the effect of one variable (on a chosen scale) depends on the value that another variable is set to. In this paper, we propose a new type of DAG-the interaction DAG (IDAG), which can be used to understand this phenomenon.MethodsThe IDAG works like any DAG but instead of including a node for the outcome, it includes a node for a causal effect. We introduce concepts such as confounded interaction and total, direct and indirect interaction, showing that these can be depicted in ways analogous to how similar concepts are depicted in standard DAGs. This also allows for conclusions on which treatment interactions to account for empirically. Moreover, since generalizability can be compromised in the presence of underlying interactions, the framework can be used to illustrate threats to generalizability and to identify variables to account for in order to make results valid for the target population.ConclusionsThe IDAG allows for a both intuitive and stringent way of illustrating interactions. It helps to distinguish between causal and non-causal mechanisms behind effect variation. Conclusions about how to empirically estimate interactions can be drawn-as well as conclusions about how to achieve generalizability in contexts where interest lies in estimating an overall effect.

| S-EPMC8128466 | biostudies-literature

Simplifying Weighted Heterogeneous Networks by Extracting h-Structure via s-Degree.

Project description:In this study, we developed a method to extract the core structure of weighted heterogeneous networks by transforming the heterogeneous networks into homogeneous networks. Using the standardized z-score, we define the s-degree by summing all the z-scores of adjacent edges into base-nodes for a weighted heterogeneous network. Then, we rank all the s-degrees in decreasing order to obtain the core structure via the h-index of a base-homogeneous-network. After reducing all adjacent edges between the attribute nodes and base-nodes to the core structure, we obtain the heterogeneous core structure of the weighted network, which is called the h-structure. We find that the h-structure in a heterogeneous network contains less than 1% nodes and edges, which results in the construction of a highly effective simplification of a weighted heterogeneous network. Two practical cases, the citation network and the co-purchase network, were examined in this study.

| S-EPMC6906333 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data