In this study, a new methodology based on the Hadamard matrix is proposed to construct quantum Boolean functions f such that f ： I2n --2P2n, where I2n is an identity matrix of order 2n and P2n is a projective matrix ...
详细信息
In this study, a new methodology based on the Hadamard matrix is proposed to construct quantum Boolean functions f such that f ： I2n --2P2n, where I2n is an identity matrix of order 2n and P2n is a projective matrix with the same order as I2n. The enumeration of this class of quantum Boolean functions is also presented.
With the rapid growth of data volume, knowledge acquisition for bigdata has become a new challenge. To address this issue, the hierarchical decision table is defined and implemented in this work. The properties of di...
详细信息
ISBN:
(纸本)9781467372220
With the rapid growth of data volume, knowledge acquisition for bigdata has become a new challenge. To address this issue, the hierarchical decision table is defined and implemented in this work. The properties of different hierarchical decision tables are discussed under the different granularity of conditional attributes. A novel knowledge acquisition algorithm for bigdata using MapReduce is proposed. Experimental results demonstrate that the proposed algorithm is able to deal with bigdata and mine hierarchical decision rules under the different granularity.
The Anchor-based Multi-view Subspace Clustering (AMSC) has turned into a favourable tool for large-scale multi-view clustering. However, there still exist some limitations to the current AMSC approaches. First, they t...
详细信息
The Anchor-based Multi-view Subspace Clustering (AMSC) has turned into a favourable tool for large-scale multi-view clustering. However, there still exist some limitations to the current AMSC approaches. First, they typically recover anchor graph structure in the original linear space, restricting their feasibility for nonlinear scenarios. Second, they usually overlook the potential benefits of jointly capturing the inter-view and intra-view information for enhancing the anchor representation learning. Third, these approaches mostly perform anchor-based subspace learning by a specific matrix norm, neglecting the latent high-order correlation across different views. To overcome these limitations, this paper presents an efficient and effective approach termed Large-scale Tensorized Multi-view Kernel Subspace Clustering (LTKMSC). Different from the existing AMSC approaches, our LTKMSC approach exploits both inter-view and intra-view awareness for anchor-based representation building. Concretely, the low-rank tensor learning is leveraged to capture the high-order correlation (i.e., the inter-view complementary information) among distinct views, upon which the \(l_{1,2}\) norm is imposed to explore the intra-view anchor graph structure in each view. Moreover, the kernel learning technique is leveraged to explore the nonlinear anchor-sample relationships embedded in multiple views. With the unified objective function formulated, an efficient optimization algorithm that enjoys low computational complexity is further designed. Extensive experiments on a variety of multi-view datasets have confirmed the efficiency and effectiveness of our approach when compared with the other competitive approaches.
暂无评论