检索结果-内蒙古大学图书馆

Incomplete multi-view clustering via efficient anchor tensor recovery framework

Neural Networks 2025年 190卷 107652页

作者： Jintian Ji Songhe Feng Jie Huang Taotao Wei Xiang Feng Peiwu Lv Bing Li School of Computer Science and Technology Beijing Jiaotong University Beijing 100044 China Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education Beijing Jiaotong University Beijing 100044 China Jiangsu Railway Group Co. Ltd. Nanjing 210012 China Jiangsu Province Engineering Research Center of Intelligent and Green Railway Nanjing 210012 China The National Laboratory of Pattern Recognition (NLPR) Institute of Automation Chinese Academy of Sciences (CASIA) Beijing 100190 China

Tensor-based Incomplete Multi-view Clustering (TIMC) methods have received widespread attention due to the powerful data recovery capability of capturing cross-view high-order correlation. Although such methods have achieved remarkable progress, they still suffer from the following problems: (1) The extremely high computational complexity makes it hard for tensor-based methods to handle large-scale multi-view data. (2) Geometric structure constraints in the sample space often lead to high computational complexity and redundancy of structural information. (3) The commonly used Tensor Nuclear Norm (TNN) over-penalizes the primary rank components, leading to a sub-optimal representation tensor. Being aware of these, we propose Incomplete Multi-View Clustering with E fficient A nchor Te nsor R ecovery Framework (EATER). Specifically, it learns a group of anchors to construct a low-rank anchor tensor to recover the missing data with the high-order correlation among views and the geometric structure in the learned representation tensor is enhanced by an Anchor Laplacian Regularization (ALR). Moreover, instead of employing TNN, we adopt a tighter Non-convex Tensor Rank (NTR) to capture the multi-view high-order correlation effectively. An efficient iterative optimization algorithm is designed to solve the EATER, which is time-economical and enjoys favorable convergence. Extensive experimental results on various datasets demonstrate the superiority of the proposed algorithm as compared to state-of-the-art methods.

关键词： Geometric structure constraint High-order correlation Incomplete multi-view clustering Non-convex tensor rank

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Cross-Domain Feature Representation Learning Method Based on Dual Constraints

Nonlinear Cross-Domain Feature Representation Learning Metho...

引用

IEEE International Conference on big knowledge (ICBK)

作者： Han Ding Yuhong Zhang Shuai Yang Yaojin Lin Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Data Science and Intelligence Application Fujian Province University Zhangzhou China

Feature representation learning is a research focus in domain adaptation. Recently, due to the fast training speed, the marginalized Denoising Autoencoder (mDA) as a standing deep learning model has been widely utilized for feature representation learning. However, the training of mDA suffers from the lack of nonlinear relationship and does not explicitly consider the distribution discrepancy between domains. To address these problems, this paper proposes a novel method for feature representation learning, namely Nonlinear cross-domain Feature learning based Dual Constraints (NFDC), which consists of kernelization and dual constraints. Firstly, we introduce kernelization to effectively extract nonlinear relationship in feature representation learning. Secondly, we design dual constraints including Maximum Mean Discrepancy (MMD) and Manifold Regularization (MR) in order to minimize distribution discrepancy during the training process. Experimental results show that our approach is superior to several state-of-the-art methods in domain adaptation tasks.

关键词： Noise reduction Manifolds Training Adaptation models Kernel Deep learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Kernelized multiview subspace analysis by self-weighted learning

arXiv

引用

arXiv 2019年

作者： Wang, Huibing Wang, Yang Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University Dalian Liaoning116021 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology China

—With the popularity of multimedia technology, information is always represented or transmitted from multiple views. Most of the existing algorithms are graph-based ones to learn the complex structures within multiview data but overlooked the information within data representations. Furthermore, many existing works treat multiple views discriminatively by introducing some hyperparameters, which is undesirable in practice. To this end, abundant multiview based methods have been proposed for dimension reduction. However, there are still no research to leverage the existing work into a unified framework. To address this issue, in this paper, we propose a general framework for multiview data dimension reduction, named Kernelized Multiview Subspace Analysis (KMSA). It directly handles the multi-view feature representation in the kernel space, which provides a feasible channel for direct manipulations on multiview data with different dimensions. Meanwhile, compared with those graph-based methods, KMSA can fully exploit information from multiview data with nothing to lose. Furthermore, since different views have different influences on KMSA, we propose a self-weighted strategy to treat different views discriminatively according to their contributions. A co-regularized term is proposed to promote the mutual learning from multi-views. KMSA combines self-weighted learning with the co-regularized term to learn appropriate weights for all views. We also discuss the influence of the parameters in KMSA regarding the weights of multi-views. We evaluate our proposed framework on 6 multiview datasets for classification and image retrieval. The experimental results validate the advantages of our proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

HPV-CCDC106 integration alters local chromosome architecture and hijacks an enhancer by three-dimensional genome structure remodeling in cervical cancer

引用

Journal of Genetics and Genomics 2020年第8期47卷 435-448页

作者： Canhui Cao Ping Hong Xingyu Huang Da Lin Gang Cao Liming Wang Bei Feng Ping Wu Hui Shen Qian Xu Ci Ren Yifan Meng Wenhua Zhi Ruidi Yu Juncheng Wei Wencheng Ding Xun Tian Qinghua Zhang Wei Li Qinglei Gao Gang Chen Kezhen Li Wing-Kin Sung Zheng Hu Hui Wang Guoliang Li Peng Wu Department of Gynecologic Oncology Tongji HospitalTongji Medical CollegeHuazhong University of Science and TechnologyWuhan430030China Cancer Biology Research Center(Key Laboratory of the Ministry of Education) Tongji HospitalTongji Medical CollegeHuazhong University of Science and TechnologyWuhan430030China National Key Laboratory of Crop Genetic Improvement Huazhong Agricultural UniversityWuhan430070China Agricultural Bioinformatics Key Laboratory of Hubei Province Hubei Engineering Technology Research Center of Agricultural Big DataCollege of InformaticsHuazhong Agricultural UniversityWuhan430070China State Key Laboratory of Agricultural Microbiology Huazhong Agricultural UniversityWuhan430070China Bio-Medical Center Huazhong Agricultural UniversityWuhan430070China College of Veterinary Medicine Huazhong Agricultural UniversityWuhan430070China Department of Obstetrics and Gynecology Union HospitalTongji Medical CollegeHuazhong University of Science and TechnologyWuhan430022China Department of Obstetrics and Gynecology Key Laboratory for Molecular Diagnosis of Hubei ProvinceThe Central Hospital of WuhanTongji Medical CollegeHuazhong University of Science and TechnologyWuhan430010China Department of Computational and Systems Biology Genome Institute of SingaporeSingapore Department of Gynecological Oncology The First Affiliated Hospital of Sun Yat-sen UniversityGuangzhou510080China

Integration of human papillomavirus(HPV)DNA into the human genome is a reputed key driver of cervical ***,the effects of HPV integration on chromatin structural organization and gene expression are largely *** studied a cohort of 61 samples and identified an integration hot spot in the CCDC106 gene on chromosome *** then selected fresh cancer tissue that contained the unique integration loci at CCDC106 with no HPV episomal DNA and performed whole-genome,RNA,chromatin immunoprecipitation and high-throughput chromosome conformation capture(Hi-C)sequencing to identify the mechanisms of HPV integration in cervical *** analyses indicated that chromosome 19 exhibited significant genomic variation and differential expression densities,with correlation found between three-dimensional(3D)structural change and gene ***,HPV integration divided one topologically associated domain(TAD)into two smaller TADs and hijacked an enhancer from PEG3 to CCDC106,with a decrease in PEG3 expression and an increase in CCDC106 *** expression dysregulation was further confirmed using 10 samples from our cohort,which exhibited the same HPV-CCDC106 *** summary,we found that HPV-CCDC106 integration altered local chromosome architecture and hijacked an enhancer via 3D genome structure ***,this study provides insight into the 3D structural mechanism underlying HPV integration in cervical carcinogenesis.

关键词： Cervical cancer HPV integration Fusion gene Hi-C Enhancer TAD

来源：评论

学校读者我要写书评

暂无评论

On-edge multi-task transfer learning: Model and practice with data-driven task allocation

arXiv

引用

arXiv 2021年

作者： Zheng, Zimu Chen, Qiong Hu, Chuang Wang, Dan Liu, Fangming The National Engineering Research Center for Big Data Technology and System Key Laboratory of Services Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China The Edge Cloud Innovation Lab. Technical Innovation Department Cloud BU Huawei Technologies Co. Ltd. Shenzhen China The Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Hong Kong

On edge devices, data scarcity occurs as a common problem where transfer learning serves as a widely-suggested remedy. Nevertheless, transfer learning imposes heavy computation burden to the resource-constrained edge devices. Existing task allocation works usually assume all submitted tasks are equally important, leading to inefficient resource allocation at a task level when directly applied in Multi-task Transfer Learning (MTL). To address these issues, we first reveal that it is crucial to measure the impact of tasks on overall decision performance improvement and quantify task importance. We then show that task allocation with task importance for MTL (TATIM) is a variant of NP-complete Knapsack problem, where the complicated computation to solve this problem needs to be conducted repeatedly under varying contexts. To solve TATIM with high computational efficiency, we propose a data-driven Cooperative Task Allocation (DCTA) approach. Finally, we evaluate the performance of DCTA by not only a trace-driven simulation, but also a new comprehensive real-world AIOps case study which bridges model and practice via a new architecture and main components design within AIOps system. Extensive experiments show that our DCTA reduces 3.24 times of processing time, and saves 48.4% energy consumption compared with the state-of-the-art when solving TATIM. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Kernel Inversed Pyramidal Resizing Network for Efficient Pavement Distress Recognition

arXiv

引用

arXiv 2022年

作者： Qin, Rong Huangfu, Luwen Hood, Devon Ma, James Huang, Sheng School of Big Data & Software Engineering Chongqing University Chongqing400044 China Fowler College of Business San Diego State University San DiegoCA92182 United States Center for Human Dynamics in the Mobile Age San Diego State University San DiegoCA92182 United States College of Science San Diego State University San DiegoCA92182 United States Department of Business Analysis University of Colorado Colorado SpringsCO80918 United States Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University Chongqing400044 China

Pavement Distress Recognition (PDR) is an important step in pavement inspection and can be powered by image-based automation to expedite the process and reduce labor costs. Pavement images are often in high-resolution with a low ratio of distressed to non-distressed areas. Advanced approaches leverage these properties via dividing images into patches and explore discriminative features in the scale space. However, these approaches usually suffer from information loss during image resizing and low efficiency due to complex learning frameworks. In this paper, we propose a novel and efficient method for PDR. A light network named the Kernel Inversed Pyramidal Resizing Network (KIPRN) is introduced for image resizing, and can be flexibly plugged into the image classification network as a pre-network to exploit resolution and scale information. In KIPRN, pyramidal convolution and kernel inversed convolution are specifically designed to mine discriminative information across different feature granularities and scales. The mined information is passed along to the resized images to yield an informative image pyramid to assist the image classification network for PDR. We applied our method to three well-known Convolutional Neural Networks (CNNs), and conducted an evaluation on a large-scale pavement image dataset named CQU-BPDD. Extensive results demonstrate that KIPRN can generally improve the pavement distress recognition of these CNN models and show that the simple combination of KIPRN and EfficientNetB3 significantly outperforms the state-of-the-art patch-based method in both performance and efficiency. © 2022, CC BY-NC-SA.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Forward engineering completeness for software by using requirements validation framework 31

Forward engineering completeness for software by using requi...

引用

31st International Conference on Software engineering and knowledge engineering, SEKE 2019

作者： Iqbal, Nayyar Sang, Jun Gao, Min Hu, Haibo Xiang, Hong Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing University Chongqing400044 China School of Big Data and Software Engineering Chongqing University Chongqing401331 China Department of Computer Science University of Agriculture Faisalabad Faisalabad38000 Pakistan

ISBN: (纸本)1891706489

In software development environment, software companies usually ignore the user requirements validation process in requirement gathering phase, which results in large number of modifications being required in the software maintenance phase to fulfill the customer requirements. Identification of accurate requirements from user stories and determining the effectiveness of work deliverable of software industry has always been a challenging task. In this paper, a new measurement approach for forward engineering completeness for software was introduced by using requirements validation framework. The forward engineering completeness for software was measured in two steps. In the first step, software component structure was developed in order to find the functional and nonfunctional requirements rejected by the customers in the requirement validation framework. In the second step, completeness of software from component-based development was determined in which the following parameters, such as functional, non-functional completeness attributes, were considered in the measurement process, and the unadopted attributes of the reuse code were also considered. Quality level for the attributes were assigned based upon the valuation of interior quality of the source code. Therefore, it resulted in the reduction of development time required for the software and the cost required for the software development was also reduced. A case study was incorporated in this research to explain the measurement process of forward engineering completeness. If the forward engineering code is satisfying the quality standards, then the code is in the completeness form. The attributes of code that negates to be used were considered as unadopted attributes. © 2019 knowledge Systems Institute Graduate School. All rights reserved.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

data-driven optimization algorithm for economic operation of microgrid based on dynamic Kriging model and two-stage search strategy

Research Square

引用

Research Square 2021年

作者： Fan, Chaodong Hou, Bo Qu, Xilong Xiao, Leyi Cheng, Fanyong Hunan Provincial Key Laboratory of Finance & Economics Big Data Science and Technology School of Information Technology and Management Hunan University of Finance and Economics Changsha410205 China Key Laboratory of Advanced Perception and Intelligent Control of High-end Equipment Ministry of Education Anhui Polytechnic University Wuhu241000 China Foshan Green Intelligent Manufacturing Research Institute Xiangtan University Guangdong 528311 China School of Electrical and Electronic Engineering Nanyang Technological University Singapore639798 Singapore School of Automation and Electronic Information Xiangtan University Xiangtan411105 China

The economic operation optimization of microgrid is an important research topic in the power system. Therefore, this paper proposes a surrogate model particle swarm optimization algorithm based on the global-local search mechanism. Firstly, aiming at the problem that the statistical information of Kriging model is difficult to guarantee the prediction accuracy, the dynamic transformation is carried out to enhance the robustness of the model;secondly, the global-local search mechanism is introduced to make the algorithm fully explore the fitness landscape near the Kriging model after quickly locating the current optimal particle position, so as to achieve the balance of convergence quality and convergence efficiency. The proposed method has been tested on numerous benchmark test functions from two test suites, and the results show that the proposed algorithm has more advantages than other comparison algorithms in optimization accuracy. Finally, simulations are carried out in two operating modes of microgrid islanding and grid-connected, which has verified the effectiveness of the proposed method. © 2021, CC BY.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A layered parallel algorithm for data clustering via fuzzy c-means technique

Research Square

引用

Research Square 2021年

作者： Mu, Yashuang Wei, Wei Guo, Hongyue Sun, Lijun Key Laboratory of Grain Information Processing and Control Henan University of Technology Ministry of Education Zhengzhou450001 China School of Artificial Intelligence and Big Data Henan University of Technology Zhengzhou450001 China College of Information Science and Engineering Henan University of Technology Zhengzhou450001 China School of Maritime Economics and Management Dalian Maritime University Dalian116026 China Collaborative Innovation Center for Transport Studies Dalian Maritime University Dalian116026 China

In this study, a layered parallel algorithm via fuzzy c-means (FCM) technique, called LP-FCM, is proposed in the framework of Map-Reduce for data clustering problems. The LP-FCM mainly contains three layers. The first layer follows a parallel data partitioning method which is developed to randomly divide the original dataset into several subdatasets. The second layer uses a parallel cluster centers searching method based on Map-Reduce, where the classic FCM algorithm is applied to search the cluster centers for each subdataset in Map phases, and all the centers are gathered to the Reduce phase for the confirmation of the final cluster centers through FCM technique again. The third layer implements a parallel data clustering method based on the final cluster centers. After comparing with some famous classic random initialization sequential clustering algorithms which include K-means, K-medoids, FCM and MinMaxK-means on 20 benchmark datasets, the feasibility in terms of clustering accuracy is evaluated. Furthermore, the clustering time and the parallel performance are also tested on some generated large-scale datasets for the parallelism. © 2021, CC BY.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Deep semantic dictionary learning for multi-label image classification

arXiv

引用

arXiv 2020年

作者： Zhou, Fengtao Huang, Sheng Xing, Yun School of Big data & Software Engineering Chongqing University Shazheng street NO.174 Shapingba District Chongqing400044 China Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Shazheng street NO.174 Shapingba District Chongqing400044 China

Compared with single-label image classification, multi-label image classification is more practical and challenging. Some recent studies attempted to leverage the semantic information of categories for improving multi-label image classification performance. However, these semantic-based methods only take semantic information as type of complements for visual representation without further exploitation. In this paper, we present an innovative path towards the solution of the multi-label image classification which considers it as a dictionary learning task. A novel end-to-end model named Deep Semantic Dictionary Learning (DSDL) is designed. In DSDL, an auto-encoder is applied to generate the semantic dictionary from class-level semantics and then such dictionary is utilized for representing the visual features extracted by Convolutional Neural Network (CNN) with label embeddings. The DSDL provides a simple but elegant way to exploit and reconcile the label, semantic and visual spaces simultaneously via conducting the dictionary learning among them. Moreover, inspired by iterative optimization of traditional dictionary learning, we further devise a novel training strategy named Alternately Parameters Update Strategy (APUS) for optimizing DSDL, which alternately optimizes the representation coefficients and the semantic dictionary in forward and backward propagation. Extensive experimental results on three popular benchmarks demonstrate that our method achieves promising performances in comparison with the state-of-the-arts. Our codes and models have been released1 © 2020, CC BY-NC-SA.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：