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.
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.
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.
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.
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 …
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…
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.
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.
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.
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.
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.
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.
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).
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.
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.
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.
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.
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.
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.
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.
FastDTW is often slower than exact DTW in practical applications.
problem The performance gap between FastDTW and exact DTW in real-world data mining tasks.
method Comparison of FastDTW and exact DTW performance in various data mining applications.
result FastDTW is generally slower than exact DTW in practical applications.
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.
In sustained growth with random dynamics stationary distributions can exist without detailed balance. This suggests thermodynamical behavior in fast growing complex systems. In order to model such phenomena we apply both a discrete and a continuous master equation. The derivation of elementary rates from known stationa…
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…
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.
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.
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.…
New method for matching bipartite and unipartite graphs without collapsing.
problem Matching between bipartite and unipartite networks without losing information.
method Formulated as an undirected graphical model, aligns graphs without collapsing.
result Consistent method with conditions for exact recovery of matching solution.
We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model us…
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.
The paper explores Wiener-Granger causality and its computational enhancements.
problem Analyzing causal relationships between time series data.
method Detailed overview of Granger causality, historical development, and computational advancements.
result Enhanced application of Granger causality in various fields.
Graph filtering framework improves semi-supervised learning efficiency.
problem Efficiently leverage unlabeled data with limited labeled data.
method Graph filtering to inject graph similarity into data features.
result Unified insights and improved modeling capabilities of label propagation and graph convolutional networks.
Hybrid LLM and quantum optimization improve CSA collateral management by 9-10%.
problem Finance-native collateral optimization under ISDA CSAs with legal constraints.
method Hybrid pipeline combining LLM, quantum-inspired exploration, and CP-SAT.
result Improves a strong classical baseline by 9.1-10.7% across different scenarios.
Improved the convergence proof of ADAM-Optimizer.
problem Incorrect convergence proof of ADAM-Optimizer.
method Provided an improved convergence proof.
result Corrected the convergence proof of ADAM-Optimizer.
Dual-Primal Graph CNN learns vertex and edge features on graphs.
problem Learning features on non-Euclidean structured data like graphs.
method Alternates graph convolutional operations on graph and its dual.
result State-of-the-art results on various graph benchmarks.
Living review of ML for particle physics, updated frequently.
problem Keeping up with rapid advancements in ML for particle physics.
method Creating a living document to list and update citations of ML applications.
result Provides a comprehensive list of ML citations for particle physics.
Paper combines machine learning and model averaging for robust parameter estimation.
problem Estimating structural parameters with partially unknown functional forms.
method Pairing double/debiased machine learning with stacking for model averaging.
result DDML with stacking is more robust to unknown functional forms than single learners.
Improves community detection in directed networks with theoretical guarantees.
problem Degree heterogeneity affects community detection in directed networks.
method Introduced D-SCORE algorithm and established theoretical guarantees for Directed-DCBM.
result Established theoretical guarantees and provided improvements for D-SCORE.
Gradually Truncated Log-normal distribution - Size distribution of firms Abstract Many natural and economical phenomena are described through power law or log- normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these di…
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.
While many statistical models and methods are now available for network analysis, resampling network data remains a challenging problem. Cross-validation is a useful general tool for model selection and parameter tuning, but is not directly applicable to networks since splitting network nodes into groups requires delet…