Results 41 to 50 of about 1,241,382 (276)

An Improving Approach for Top-Rank- Frequent Pattern Mining

Vietnam Journal of Computer Science, 2022
Mining frequent patterns (FPs) received a lot of research interest which is a fundamental problem in the field of data mining. It has been studied on many database types with various applications in intelligent systems.
Ham Nguyen
doaj   +1 more source

ICA’s bug: How ghost ICs emerge from effective rank deficiency caused by EEG electrode interpolation and incorrect re-referencing

Frontiers in Signal Processing, 2023
Independent component analysis (ICA) has been widely used for electroencephalography (EEG) analyses. However, ICA performance relies on several crucial assumptions about the data.
Hyeonseok Kim, Justin Luo, Shannon Chu, Cedric Cannard, Cedric Cannard, Sven Hoffmann, Makoto Miyakoshi, Makoto Miyakoshi, Makoto Miyakoshi   +8 more
doaj   +1 more source

Selection and Experimentation of the Best Hybrid Green Composite Using Advanced MCDM Methods for Clean Sustainable Energy Recovery: A Novel Approach [PDF]

International Journal of Mathematical, Engineering and Management Sciences, 2020
Relevant and appropriate selection of best hybrid material is a challenging task for the recent industries. The mandatory criterion is to deal with the enhanced productivity with minimum cost.
Soutrik Bose, Nabankur Mandal, Titas Nandi   +2 more
doaj   +1 more source

Minimum rank and zero forcing number for butterfly networks

, 2018
The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$.
Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep   +4 more
core   +1 more source

Minimum rank of powers of trees [PDF]

The Electronic Journal of Linear Algebra, 2012
The minimum rank of a simple graph G over a field F is the smallest possible rank among all real symmetric matrices, over F, whose (i, j)-entry (for i 6= j) is nonzero whenever ij is an edge in G and is zero otherwise. In this paper, the problem of minimum rank of (strict) powers of trees is studied.
Luz DeAlba, Jason Grout, In-Jae Kim, Steve Kirkland, Judith McDonald, Amy Yielding   +5 more
openaire   +1 more source

Low-Rank Matrix Recovery from Noise via an MDL Framework-Based Atomic Norm

Sensors, 2020
The recovery of the underlying low-rank structure of clean data corrupted with sparse noise/outliers is attracting increasing interest. However, in many low-level vision problems, the exact target rank of the underlying structure and the particular ...
Anyong Qin, Lina Xian, Yongliang Yang, Taiping Zhang, Yuan Yan Tang   +4 more
doaj   +1 more source

Hybrid Matrix Completion Model for Improved Images Recovery and Recommendation Systems

IEEE Access, 2021
Matrix completion methods have been widely applied in images recovery and recommendation systems. Most of them are only based on the low-rank characteristics of matrices to predict the missing entries.
Kai Xu, Ying Zhang, Zhurong Dong, Zhanyu Li, Bopeng Fang   +4 more
doaj   +1 more source

A note on the minimum rank of graphs with given dominating induced subgraph

The American Journal of Combinatorics
An induced subgraph of a graph \(G\) is said to be dominating if every vertex of \(G\) is at distance at most one from this subgraph. We investigate pairs \((G, F)\) where \(F\) is a non-singular dominating induced subgraph of \(G,\) and the rank of \(G\
Zoran Stanić
doaj   +1 more source

Minimum Symbol Error Probability MIMO Design under the Per-Antenna Power Constraint

Journal of Electrical and Computer Engineering, 2012
Approximate minimum symbol error probability transceiver design of single user MIMO systems under the practical per-antenna power constraint is considered.
Enoch Lu, I.-Tai Lu
doaj   +1 more source

The Minimum Rank of a Correlation Matrix [PDF]

Proceedings of the National Academy of Sciences, 1944
Not ...
openaire   +2 more sources