Results 251 to 260 of about 6,652,811 (287)
Some of the next articles are maybe not open access.
Neural Networks, 2020
Transform learning is a new representation learning framework where we learn an operator/transform that analyses the data to generate the coefficient/representation. We propose a variant of it called the graph transform learning; in this we explicitly account for the correlation in the dataset in terms of graph Laplacian.
openaire +3 more sources
Transform learning is a new representation learning framework where we learn an operator/transform that analyses the data to generate the coefficient/representation. We propose a variant of it called the graph transform learning; in this we explicitly account for the correlation in the dataset in terms of graph Laplacian.
openaire +3 more sources
Unsupervised Graph Embedding via Adaptive Graph Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2023Graph autoencoders (GAEs) are powerful tools in representation learning for graph embedding. However, the performance of GAEs is very dependent on the quality of the graph structure, i.e., of the adjacency matrix. In other words, GAEs would perform poorly when the adjacency matrix is incomplete or be disturbed.
Rui Zhang +3 more
openaire +2 more sources
Internet Financial Fraud Detection Based on Graph Learning
IEEE Transactions on Computational Social Systems, 2023The rapid development of information technology such as the Internet of Things, Big Data, artificial intelligence, and blockchain has changed the transaction mode of the financial industry and greatly improved the convenience of financial transactions ...
Ranran Li +4 more
semanticscholar +1 more source
2009
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown, and the algorithm is free to choose the next vertex to predict. After observing that natural nonadaptive exploration/prediction strategies (like depth-first with majority vote ...
Cesa Bianchi N +2 more
openaire +2 more sources
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown, and the algorithm is free to choose the next vertex to predict. After observing that natural nonadaptive exploration/prediction strategies (like depth-first with majority vote ...
Cesa Bianchi N +2 more
openaire +2 more sources
Does Invariant Graph Learning via Environment Augmentation Learn Invariance?
Neural Information Processing Systems, 2023Invariant graph representation learning aims to learn the invariance among data from different environments for out-of-distribution generalization on graphs.
Yongqiang Chen +5 more
semanticscholar +1 more source
Multiple Graph-Kernel Learning
2015 IEEE Symposium Series on Computational Intelligence, 2015Kernels for structures, including graphs, generally suffer of the diagonally dominant gram matrix issue, the effect by which the number of sub-structures, or features, shared between instances are very few with respect to those shared by an instance with itself.
AIOLLI, FABIO +3 more
openaire +1 more source
Position: Graph Learning Will Lose Relevance Due To Poor Benchmarks
International Conference on Machine LearningWhile machine learning on graphs has demonstrated promise in drug design and molecular property prediction, significant benchmarking challenges hinder its further progress and relevance.
Maya Bechler-Speicher +11 more
semanticscholar +1 more source
KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning
Trans. Mach. Learn. Res.In recent years, Graph Neural Networks (GNNs) have become the de facto tool for learning node and graph representations. Most GNNs typically consist of a sequence of neighborhood aggregation (a.k.a., message-passing) layers, within which the ...
Roman Bresson +5 more
semanticscholar +1 more source
Meta Graph Learning for Long-tail Recommendation
Knowledge Discovery and Data Mining, 2023Highly skewed long-tail item distribution commonly hurts model performance on tail items in recommendation systems, especially for graph-based recommendation models.
Chunyu Wei +5 more
semanticscholar +1 more source
Graph-Based Semisupervised Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008Graph-based learning provides a useful approach for modeling data in classification problems. In this modeling scenario, the relationship between labeled and unlabeled data impacts the construction and performance of classifiers, and therefore a semi-supervised learning framework is adopted. We propose a graph classifier based on kernel smoothing.
Mark, Culp, George, Michailidis
openaire +2 more sources

