A multi-task model tackles citation purpose classification with limited data.
problem Classifying citations based on their purpose is challenging due to limited labeled data and subjectivity.
method Combines linguistic features, TF-IDF, and an LSTM-with-attention model for multi-task learning.
result Improves classification accuracy compared to single-task models.
The paper proposes a novel model to forecast patent citations using multi-attention recurrent networks.
problem Forecasting forward citations to patents to discover emerging technologies.
method The approach employs a sequence-to-sequence model with an attention-of-attention mechanism to capture dependencies in multiple time sequences.
result The proposed model outperforms state-of-the-art models in forward citation forecasting.
A novel model-selection method for dynamic networks using synthetic data.
problem Classifying and understanding the growth mechanisms of dynamic networks.
method Training a classifier on synthetic network data generated by nine random graph models, using dynamic features that count new links.
result Achieves near-perfect classification of synthetic networks, outperforming state-of-the-art methods.
A new HGNN framework for complex data representation learning.
problem Learning representation for complex data in hypergraph structures.
method Designing hyperedge convolution operations for hypergraph learning.
result HGNN outperforms state-of-the-art methods in citation network and visual object recognition tasks.
A combined model integrates latent factor and logistic regression for citation network analysis.
problem Insufficient representation by either latent factor or logistic regression alone.
method Proposes a combined model integrating latent factor and logistic regression, with parameter estimation through joint-likelihood and penalty terms.
result The proposed method captures both main technological trends and ad-hoc dependencies in citation networks.
Synthetic reference strings are as effective as real ones for training citation parsing models.
problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.
Measuring the impact of scientific articles is important for evaluating the research output of individual scientists, academic institutions and journals. While citations are raw data for constructing impact measures, there exist biases and potential issues if factors affecting citation patterns are not properly account…
GraphAT improves graph neural networks by dynamically considering connected examples in adversarial training.
problem Graph neural networks are vulnerable to adversarial perturbations due to connections between examples.
method GraphAT dynamically regularizes based on graph structure to resist adversarial perturbations.
result GraphAT outperforms normal training on GCN by 4.51% in node classification accuracy.
We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions.…
Novel graph network learns hierarchical network structure.
problem Lack of information in hierarchical network topology.
method Hierarchical clustering for multiscale decomposition, graph convolutional layers.
result Competitive performance on citation network benchmark.
A hybrid model reduces graph complexity for improved classification accuracy.
problem High computational complexity and large number of parameters in higher-order graph convolutional networks.
method Weight sharing mechanism and novel fusion pooling layer to reduce parameters and complexity.
result The proposed model achieves highest classification accuracy with fewer trainable parameters.
GCNs' performance linked to feature, graph, and ground truth alignment.
problem Improving GCNs' classification performance.
method Subspace alignment measure (SAM) based on Frobenius norm of chordal distances.
result SAM quantifies the alignment between features, graph, and ground truth.
Bibliographic analysis considers author's research areas, the citation network and paper content among other things. In this paper, we combine these three in a topic model that produces a bibliographic model of authors, topics and documents using a non-parametric extension of a combination of the Poisson mixed-topic li…
Bibliographic analysis considers the author's research areas, the citation network and the paper content among other things. In this paper, we combine these three in a topic model that produces a bibliographic model of authors, topics and documents, using a nonparametric extension of a combination of the Poisson mixed-…
SentiCite analyzes citations for sentiment and nature, improving on existing methods.
problem Identifying quality scientific work amidst many citations.
method Sentiment analysis of citations with motivation detection.
result SentiCite outperforms state-of-the-art methods with a F1-measure of 0.71.
LGGAN generates labeled graphs from graph data.
problem Training generative models for graph-structured data with labels.
method LGGAN, a GAN approach, trains deep models for graph data with node labels.
result LGGAN generates diverse labeled graphs that match training data and outperforms alternatives.
Improves graph convolutional networks by making their outputs smoother.
problem GCNs lack consideration for the smoothness of their output distributions against local perturbations.
method Introduces BVAT, a regularization method that generates virtual adversarial perturbations for graph-structured data.
result Establishes state-of-the-art results in semi-supervised node classification tasks.
Proposes GLNNs for robust semi-supervised classification using adaptive graphs.
problem Adaptive graph learning for robust semi-supervised classification.
method Optimizes graph structure from data and tasks using spectral graph theory and maximum a posteriori estimation.
result GLNNs outperform state-of-the-art approaches in semi-supervised classification.
DFNets uses feedback-looped filters for better graph CNN performance.
problem Improving CNN performance on graph structured data.
method DFNets incorporates feedback-looped spectral graph filters.
result DFNets outperforms state-of-the-art methods in document and entity classification tasks.
SF-GCN improves semi-supervised classification by fusing multi-view data structures.
problem Semi-supervised classification challenges due to multi-view data diversity and complexity.
method Structure fusion based on graph convolutional networks (SF-GCN) that balances specificity and commonality.
result SF-GCN outperforms state-of-the-art methods on citation networks datasets.
Advances citation and subject label recommendation using multi-modal adversarial autoencoders.
problem Improving recommendation systems for citations and subject labels.
method Multi-modal adversarial autoencoders with adversarial regularization, sparsity, and input modality analysis.
result Adversarial regularization consistently improves recommendation performance.
GCNs adapted for road networks improve performance on edge prediction tasks.
problem Improving machine learning on road networks for edge prediction tasks.
method Introducing Relational Fusion Network (RFN) for road networks.
result RFN outperforms state-of-the-art GCNs on road segment regression and classification tasks.
Paper introduces a core-periphery model for identifying informative network structures.
problem Noise and bias in non-informative periphery structures obscure the informative core in complex networks.
method Spectral algorithms for core identification as a preprocessing step for network analysis.
result The proposed method outperforms traditional core-periphery methods in various downstream tasks.
Objectives: Text categorization has been used in biomedical informatics for identifying documents containing relevant topics of interest. We developed a simple method that uses a chi-square-based scoring function to determine the likelihood of MEDLINE citations containing genetic relevant topic. Methods: Our procedure …
Simpler GNNs with low-rank non-parametric aggregators perform well on graph benchmarks.
problem Over-engineering in GNN architectures for common semi-supervised node classification datasets.
method Replacing feature aggregation with a non-parametric learner to streamline GNN design.
result Non-parametric regression is effective for semi-supervised learning on sparse, directed networks.
GraphNAS uses reinforcement learning to automatically design graph neural network architectures.
problem Designing effective graph neural network architectures requires manual work and domain knowledge.
method GraphNAS generates variable-length strings to describe architectures and trains a recurrent network with reinforcement learning to maximize validation accuracy.
result GraphNAS achieves consistently better performance on various citation and protein networks.
Visuals in scientific papers are used to express complex ideas; this study uses them to identify knowledge domains.
problem Scientific figures are underutilized in literature analysis.
method Encoded scientific figures into visual signatures and used distances between signatures to compare communities of practice.
result Figures can differentiate knowledge domains as effectively as text or citation patterns.
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
Extends multi-instance learning to nested bags for better interpretation and classification.
problem Nested bags in multi-instance learning for diverse applications.
method Bag-layer neural network layer for aggregating bags of inputs.
result Bag-layer neural network can learn and interpret complex functions over sets of sets.
Proposes dynamic graph and node feature learning in GCNNs for better adaptability.
problem Fixed graphs for all GCNN layers limit adaptability to node feature structures.
method Dynamic graph and node feature learning using Mahalanobis distance metric.
result Superior performance in point clouds and citation networks.
DREAM model improves computational efficiency for non-linear effects in relational event models.
problem Efficiently modeling non-linear effects in dynamic relational networks.
method Introduces Deep Relational Event Additive Model (DREAM) using Neural Additive Models.
result Demonstrates superior computational efficiency compared to traditional REM approaches.
GraphMix improves GNNs for semi-supervised learning.
problem Improving GNNs for semi-supervised classification.
method Parameter sharing and interpolation-based regularization.
result GraphMix improves generalization bounds and state-of-the-art performance.
Although information extraction and coreference resolution appear together in many applications, most current systems perform them as ndependent steps. This paper describes an approach to integrated inference for extraction and coreference based on conditionally-trained undirected graphical models. We discuss the advan…
AEGCN uses autoencoder constraints to improve graph node classification.
problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.
In this paper, we revisit the recurrent back-propagation (RBP) algorithm, discuss the conditions under which it applies as well as how to satisfy them in deep neural networks. We show that RBP can be unstable and propose two variants based on conjugate gradient on the normal equations (CG-RBP) and Neumann series (Neuma…
The paper models network formation using mixed logit models.
problem Modeling network formation in various fields.
method Mixed logit models, specifically the repeated-choice (RC) model.
result The RC model outperforms the multinomial logit (MNL) model in estimating network formation.
New framework exploits edge features in graph neural networks for improved performance.
problem Insufficient utilization of edge features in current graph neural networks.
method Proposes a new framework with doubly stochastic normalization and multi-dimensional edge feature handling.
result Improves performance on graph node classification and regression tasks.
Network embedding methodologies, which learn a distributed vector representation for each vertex in a network, have attracted considerable interest in recent years. Existing works have demonstrated that vertex representation learned through an embedding method provides superior performance in many real-world applicatio…
Corrects errors in Hans' pseudocovering spaces paper.
problem Mathematical errors and citation issues in Hans' pseudocovering spaces paper.
method Identifies and corrects errors in Hans' previous work.
result Addresses mathematical and citation errors in Hans' pseudocovering spaces paper.
Paper proposes KE-GCN for better graph embedding.
problem Efficiently leveraging complex graphs with heterogeneous entities and relations.
method Combines GCNs and knowledge embedding methods.
result Advantages in knowledge graph alignment and entity classification.
Paper develops an attention mechanism for long-term scientific impact prediction.
problem Predicting the long-term impact of scientific papers based on citation records.
method Develops an attention mechanism to predict long-term scientific impact.
result Emphasizing the limited attention can better stand on the shoulders of giants.
RoGAT enhances GAT robustness against adversarial attacks.
problem Vulnerability of GAT to adversarial attacks.
method Dynamic adjustment of edge weights and features, with an extra attention score.
result RoGAT outperforms other defensive methods in robustness tests.
This paper asks, "Do classics exist in megaproject management?" We identify three types of classic texts: conventional, Kuhnian, and citation classics. We find that the answer to our question depends on the definition of "classic" employed. First, "citation classics" do exist in megaproject management, and they perform…
The Classification Literature Automated Search Service, an annual bibliography based on citation of one or more of a set of around 80 book or journal publications, ran from 1972 to 2012. We analyze here the years 1994 to 2011. The Classification Society's Service, as it was termed, has been produced by the Classificati…
The Rectified Linear Unit (ReLU) is a foundational activation function in artficial neural networks. Recent literature frequently misattributes its origin to the 2018 (initial) version of this paper, which exclusively investigated ReLU at the classification layer. This paper formally corrects the citation record by tra…
Graph attention improves node classification by distinguishing important edges.
problem Node classification in graph-based learning models.
method Theoretical analysis of graph attention networks for node classification.
result Graph attention can perfectly classify nodes in an 'easy' regime but fails in a 'hard' regime.
We consider the link prediction problem in a partially observed network, where the objective is to make predictions in the unobserved portion of the network. Many existing methods reduce link prediction to binary classification problem. However, the dominance of absent links in real world networks makes misclassificati…
AdvImmune improves certifiable robustness of GNNs against adversarial attacks.
problem Vulnerability of graph neural networks to adversarial attacks.
method Proposes AdvImmune, an algorithm that optimizes with meta-gradient to improve certifiable robustness.
result Remarkably improves the ratio of robust nodes by 12%, 42%, 65% with an affordable immune budget of only 5% edges.