Results 41 to 50 of about 9,083 (186)

Improving Neutron-Gamma Discrimination with Stilbene Organic Scintillation Detector Using Blind Nonnegative Matrix and Tensor Factorization Methods

open access: yesJournal of Spectroscopy, 2019
In order to perform highly qualified neutron-gamma discrimination in mixed radiation field, we investigate the application of blind source separation methods based on nonnegative matrix and tensor factorization algorithms as new and robust neutron-gamma ...
Hanane Arahmane   +2 more
doaj   +1 more source

Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations [PDF]

open access: yesOptimization Methods and Software, 2015
Clarified notation in section 3.1.1, and used simpler score() function in section B ...
Hansen, Samantha   +2 more
openaire   +2 more sources

Kullback-Leibler Principal Component for Tensors is not NP-hard

open access: yes, 2017
We study the problem of nonnegative rank-one approximation of a nonnegative tensor, and show that the globally optimal solution that minimizes the generalized Kullback-Leibler divergence can be efficiently obtained, i.e., it is not NP-hard.
Huang, Kejun, Sidiropoulos, Nicholas D.
core   +1 more source

Free Trade Zones and Corporate ESG: Evidence From a Quasi‐Natural Experiment in China

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT This study examines how China's Pilot Free Trade Zones (FTZs) influence corporate ESG performance. Using a staggered difference‐in‐differences model on Chinese listed firms from 2009 to 2024, we combine coarsened exact matching (CEM) and geography‐based instrumental variables to ensure robust identification.
Wen Li, Yinghan Zhao, Brian Lucey
wiley   +1 more source

Efficient Nonnegative Tensor Factorization via Saturating Coordinate Descent [PDF]

open access: yesACM Transactions on Knowledge Discovery from Data, 2020
With the advancements in computing technology and web-based applications, data are increasingly generated in multi-dimensional form. These data are usually sparse due to the presence of a large number of users and fewer user interactions. To deal with this, the Nonnegative Tensor Factorization (NTF) based methods have been widely used. However existing
Balasubramaniam, Thirunavukarasu   +3 more
openaire   +3 more sources

Researcher–Entrepreneur Relationship and Performance of Innovative Startups

open access: yesInternational Journal of Finance &Economics, EarlyView.
ABSTRACT Many innovative startups are joint ventures between researchers and entrepreneurs, who collaborate in R&D and product commercialization. Government policies such as grants, subsidies, and patent licensing fees act as Pigouvian subsidies, incentivizing R&D by bridging the gap between the social and private returns of innovation.
Yangguang Huang, Helen Hui
wiley   +1 more source

SWIFT: Scalable Wasserstein Factorization for Sparse Nonnegative Tensors

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2021
Existing tensor factorization methods assume that the input tensor follows some specific distribution (i.e. Poisson, Bernoulli, and Gaussian), and solve the factorization by minimizing some empirical loss functions defined based on the corresponding distribution.
Afshar, Ardavan   +6 more
openaire   +2 more sources

User social influence analysis based on constrained nonnegative tensor factorization

open access: yesTongxin xuebao, 2016
Existing models for measuring user social influence fail to integrate both opinion and topic information.Therefore,a new constrained nonnegative tensor factorization method combining user’s opinion and the topical relevance was proposed.The method ...
Jing-jing WEI   +4 more
doaj   +2 more sources

Descent methods for Nonnegative Matrix Factorization [PDF]

open access: yes, 2008
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method called Rank-one Residue Iteration (RRI).
Blondel, Vincent D.   +2 more
core   +2 more sources

Dictionary-based Tensor Canonical Polyadic Decomposition

open access: yes, 2017
To ensure interpretability of extracted sources in tensor decomposition, we introduce in this paper a dictionary-based tensor canonical polyadic decomposition which enforces one factor to belong exactly to a known dictionary.
Cohen, Jérémy E., Gillis, Nicolas
core   +1 more source

Home - About - Disclaimer - Privacy