scholarly journals Column-wise Element Selection for Computationally Efficient Nonnegative Coupled Matrix Tensor Factorization

Author(s):  
Thirunavukarasu Balasubramaniam ◽  
Richi Nayak ◽  
Chau Yuen ◽  
Yu-Chu Tian
2015 ◽  
Vol 15 (10) ◽  
pp. 2117-2131 ◽  
Author(s):  
John Patrick Laceby ◽  
Joe McMahon ◽  
Olivier Evrard ◽  
Jon Olley

Author(s):  
BELUR V. DASARATHY

This study presents an effective approach to the hitherto little addressed problem of feature assessment and selection for pattern recognition in imprecisely supervised environments. Unlike in classical supervised environments wherein the representative training samples have crisp class labels, here the samples have fuzzy memberships in several of the different pattern classes in the environment. The new methodology reported here is an outgrowth of a recently developed tool CORPS—Class Overlap Region Partitioning Scheme initially designed for operation in supervised environments and extended later for operation in imperfectly supervised environments. The emphasis here has been the development of a computationally efficient scheme capable of evaluating as rapidly as practical a large number of features individually as to their discrimination potential based on which a smaller subset may be selected, if so desired, for more detailed evaluation in different combinations by other tools.


2016 ◽  
Vol 52 (20) ◽  
pp. 1723-1725 ◽  
Author(s):  
Youda Wan ◽  
Feiqiang Chen ◽  
Junwei Nie ◽  
Guangfu Sun

Entropy ◽  
2019 ◽  
Vol 21 (7) ◽  
pp. 632
Author(s):  
Yunhui Fu ◽  
Shin Matsushima ◽  
Kenji Yamanishi

Non-negative tensor factorization (NTF) is a widely used multi-way analysis approach that factorizes a high-order non-negative data tensor into several non-negative factor matrices. In NTF, the non-negative rank has to be predetermined to specify the model and it greatly influences the factorized matrices. However, its value is conventionally determined by specialists’ insights or trial and error. This paper proposes a novel rank selection criterion for NTF on the basis of the minimum description length (MDL) principle. Our methodology is unique in that (1) we apply the MDL principle on tensor slices to overcome a problem caused by the imbalance between the number of elements in a data tensor and that in factor matrices, and (2) we employ the normalized maximum likelihood (NML) code-length for histogram densities. We employ synthetic and real data to empirically demonstrate that our method outperforms other criteria in terms of accuracies for estimating true ranks and for completing missing values. We further show that our method can produce ranks suitable for knowledge discovery.


Author(s):  
Yijie Peng ◽  
Chun-Hung Chen ◽  
Michael C. Fu ◽  
Jian-Qiang Hu ◽  
Ilya O. Ryzhov

We propose a dynamic sampling allocation and selection paradigm for finding the alternative with the optimal quantile in a Bayesian framework. Myopic allocation policies (MAPs), analogous to existing methods in classic ranking and selection for selecting the alternative with the optimal mean, and computationally efficient selection policies are derived for selecting the alternative with the optimal quantile. Under certain conditions, we prove that the proposed MAPs and selection procedures are consistent, which means that the best quantile would be eventually correctly selected as the sample size goes to infinity. Numerical experiments demonstrate that the proposed schemes can significantly improve the performance.


Sign in / Sign up

Export Citation Format

Share Document