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.
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 …
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.
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.
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.
Interactive tool improves prediction accuracy in small datasets.
problem Challenges in machine learning with small data sets and tacit expert knowledge.
method Interactive visualization and user model to elicit feature relevance.
result User model significantly improves prediction accuracy and prior knowledge elicitation.
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.
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…
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.
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.
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.
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…
The paper identifies three types of classic texts in megaproject management.
problem Does megaproject management have classic texts?
method Identifying and categorizing three types of classic texts: conventional, Kuhnian, and citation classics.
result Citation classics exist and perform well compared to other management literature.
System identifies high impact research from academic papers.
problem Identifying high impact research amidst a growing volume of papers.
method Combines visual and text classifiers on a large dataset of PDFs and citation counts.
result Improved accuracy in predicting high impact research.
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.
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.
GraphSAGE generates node embeddings for unseen data in large graphs.
problem Inductive learning of node embeddings for unseen nodes in large graphs.
method Generative function that aggregates sampled node features from local neighborhoods.
result Outperforms baselines on inductive node classification tasks.
Network-assisted regression uses conformal prediction for valid inference.
problem Predicting node attributes using network and conventional covariates with valid statistical inference.
method Network analog of conformal prediction under mild joint exchangeability assumption.
result Achieves finite sample validity and asymptotic conditional validity for various network covariates.
VGAE learns latent representations for graphs using latent variables.
problem Learning interpretable latent representations for undirected graphs.
method Variational auto-encoder framework with graph convolutional network encoder and inner product decoder.
result VGAE achieves competitive link prediction results and improves performance with node features.
Estimates citation impact to recommend best publication venue.
problem Choosing optimal publication venue for academic papers.
method Treatment effect estimation and bias correction method.
result Effective recommendation of publication venues based on citation potential.
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-…
We correct a mistake on the citation of JSJ theory in \cite{Ni}. Some arguments in \cite{Ni} are also slightly modified accordingly.
Proposes a new neural head for asymmetric representation learning.
problem Asymmetric representation learning in directed relations.
method Role-aware neural convex divergence head.
result Role-aware projections improve directional accuracy over plain ICNN-Bregman heads.
Improves Graph Convolutional Network performance on citation datasets.
problem Improving Graph Convolutional Network performance on citation datasets.
method Exploring graph regularization and alternative graph convolution approaches.
result Explicit graph regularization was incorrectly rejected by Kipf & Welling (2016).
Surprise predicts breakthroughs in science and technology.
problem Predicting breakthroughs in science and technology.
method Using embeddings from high-dimensional stochastic block models, predicting combinations with AUC of 95%.
result Breakthroughs often occur when problems from one field are solved by researchers from another field.
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.
Researchers use estimated Kolmogorov complexity for better link prediction in graphs.
problem Improving link prediction accuracy in complex networks.
method Regularization based on an approximation of Kolmogorov complexity, which is differentiable and compatible with recent link prediction algorithms.
result The regularization method shows good performance on diverse real-world networks, but the success is likely due to an aggregation method rather than actual estimation of Kolmogorov complexity.
Improved AI patent classifier measures U.S. and China's AI patenting.
problem Measuring AI patents with high precision and generalization.
method Fine-tuning PatentSBERTa on manually labeled data from USPTO's AI Patent Dataset.
result Rapid growth in AI patenting in both countries, but different organizational patterns.
Public data boosts MICCAI papers' citations, but sharing remains low.
problem Slow adoption of public benchmarks in medical image computing.
method Analysis of MICCAI papers from 2014-2018.
result Public data boosts citations, but sharing is low.
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…
Derives formulae for general permutation equivariant layers and presents a second order graph variational encoder.
problem Tackles the limitation of previous equivariant neural networks by considering permutations of matrices.
method Derives formulae for general permutation equivariant layers, including matrix permutations. Presents a second order graph variational encoder.
result Latent distribution of equivariant generative models must be exchangeable.
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.
Simple linear model outperforms GCN in graph AE tasks.
problem Challenging tasks like link prediction and node clustering.
method Replaced GCN with a simple linear model on adjacency matrix.
result Simple model consistently reaches competitive performances.
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.
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.
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.
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.
New method estimates feature interactions in large graphs, improving on previous models.
problem Estimating latent feature interactions in large, feature-rich graphs.
method Expanding MGJ model, proposing Naive Bayes and perceptron-based approaches.
result Fast perceptron-like algorithm processes large graphs in minutes.
Many data sets contain rich information about objects, as well as pairwise relations between them. For instance, in networks of websites, scientific papers, and other documents, each node has content consisting of a collection of words, as well as hyperlinks or citations to other nodes. In order to perform inference on…
Many inference problems in structured prediction are naturally solved by augmenting a tractable dependency structure with complex, non-local auxiliary objectives. This includes the mean field family of variational inference algorithms, soft- or hard-constrained inference using Lagrangian relaxation or linear programmin…
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.
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.
EVGAE improves VGAE's latent representation learning by mitigating over-pruning.
problem Over-pruning in VGAE limits latent variable capacity and diversity.
method EVGAE uses epitomic approach with multiple sparse VGAE models (epitomes) to increase active latent units and improve generative ability.
result EVGAE outperforms VGAE in generative ability and link prediction on citation networks.
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.
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.…
Adversarial autoencoder learns data on curved manifolds.
problem Representing data with non-Euclidean geometry.
method CCM adversarial autoencoder (CCM-AAE) trained on constant-curvature Riemannian manifolds.
result CCM-AAE outperforms other autoencoders on non-Euclidean data.
New approach models sustained growth leading to stationary distributions.
problem Understanding stationary distributions in fast-growing systems.
method Applied discrete and continuous master equations, derived rates from stationary distributions.
result Reconstructed distributions for various growing systems.