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

SSRN 2023年

作者： Zhu, Fan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications No. 9 Wenyuan Road Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications No. 9 Wenyuan Road Nanjing210023 China

Cross-domain recommendation methods aim to solve the problems of data sparsity and cold start by leveraging rich information from the source domain to enhance the recommendation accuracy of the target domain. Many methods ignore auxiliary information, which is often structured. Therefore, based on the above issue, we propose a method called PPTCDR (Personalized Preference Transfer Cross-Domain Recommendation) based on heterogeneous graph neural networks. PPTCDR introduces auxiliary information to enrich the information of the source and target domains, alleviates the problem of inaccurate embedding caused by data sparsity, and performs feature embedding of users and items separately in the source and target domains. In addition, for user preference transfer, in order to achieve personalization, a personalized bridging function is provided for each user. PPTCDR first constructs heterogeneous graphs separately in the source and target domains, and learns the latent embeddings of users and items using heterogeneous graph neural networks. Then, a meta-network is used to generate a personalized bridging function for each user. Through the personalized bridging function, the user's embedding in the source domain can be transformed to the target domain, and the transformed user embedding is used as the initial embedding of cold start users in the target domain. In this paper, we set up three cross-domain tasks on the Amazon dataset to verify and compare the performance of the experiment. PPTCDR achieves MAE and RMSE performances of 0.67 and 0.94 respectively, which are respectively improved by 23% and 18% compared to the state-of-the-art works EMCDR and PTUPCDR. © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Community discovery method based on complex network of data fusion based on the super network perspective

引用

International Journal of computers and Applications 2021年第4期43卷 383-390页

作者： Pei, Li School of Computer Science & Technology Xi‘an University of Posts and Telecommunications Xi‘an China Shaanxi Key Laboratory of Network Data Intelligent Processing Xi‘an University of Posts and Telecommunications Xi‘an China Ministry of Education Key Lab For Intelligent Networks and Network Security Xi‘an Jiaotong University Xi‘an China

To enhance the computational efficiency and precision of community discovery, a community discovery algorithm with the mixed label based on the minimum description length (MDI) of information compression is proposed in this paper. Firstly, the community detection is converted to the information compression problem of seeking for an effective network structure and the quality evaluation function is constructed based on the MDL criterion. Secondly, the community discovery algorithm with heuristic mixed label movement is constructed based on the label node movement algorithm and Louvain community addition algorithm so as to reduce the quality evaluation function. Finally, the simulation experiment in the standard test set and API capture Sina microblog dataset shows that the proposed algorithm is superior to the selected comparison algorithm in computational efficiency and precision. © 2018 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

SinCWIm: An imputation method for single-cell RNA sequence dropouts using weighted alternating least squares

引用

computers in Biology and Medicine 2024年 171卷 108225-108225页

作者： Gong, Lejun Cui, Xiong Liu, Yang Lin, Cai Gao, Zhihong Jiangsu Key Lab of Big Data Security & Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Department of Burn Wound Repair and Regenerative Medicine Center The First Affiliated Hospital of Wenzhou Medical University Zhejiang Wenzhou325000 China Zhejiang Engineering Research Center of Intelligent Medicine The First Affiliated Hospital of Wenzhou Medical University Wenzhou325000 China

Background and objectives: Single-cell RNA sequencing (scRNA-seq) provides a powerful tool for exploring cellular heterogeneity, discovering novel or rare cell types, distinguishing between tissue-specific cellular composition, and understanding cell differentiation during development. However, due to technological limitations, dropout events in scRNA-seq can mistakenly convert some entries in the real data to zero. This is equivalent to introducing noise into the data of cell gene expression entries. The data is contaminated, which affects the performance of downstream analyses, including clustering, cell annotation, differential gene expression analysis, and so on. Therefore, it is a crucial work to accurately determine which zeros are due to dropout events and perform imputation operations on them. Methods: Considering the different confidence levels of different zeros in the gene expression matrix, this paper proposes a SinCWIm method for dropout events in scRNA-seq based on weighted alternating least squares (WALS). The method utilizes Pearson correlation coefficient and hierarchical clustering to quantify the confidence of zero entries. It is then combined with WALS for matrix decomposition. And the imputation result is made close to the actual number by outlier removal and data correction operations. Results: A total of eight single-cell sequencing datasets were used for comparative experiments to demonstrate the overall superiority of SinCWIm over state-of-the-art models. SinCWIm was applied to cluster the data to obtain an adjusted RAND index evaluation, and the Usoskin, Pollen and Bladder datasets scored 94.46%, 96.48% and 76.74%, respectively. In addition, significant improvements were made in the retention of differential expression genes and visualization. Conclusions: SinCWIm provides a valuable imputation method for handling dropout events in single-cell sequencing data. In comparison to advanced methods, SinCWIm demonstrates excellent performance in

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Extraction of Interactions of Genes2Genes Related to Breast Cancer

Extraction of Interactions of Genes2Genes Related to Breast ...

引用

International Conference on Software Engineering Research, Management and Applications (SERA)

作者： Lejun Gong Daoyu Huang Shixing Sun Zhihong Gao Chuandi Pan Ronggen Yang Yongmin Li Geng Yang Jiangsu Key Lab of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China Zhejiang Engineering Research Center of Intelligent Medicine The First Affiliated Hospital of Wenzhou Medical University Wenzhou China College of Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing China

ISBN: (纸本)9781538658871

Breast cancer is the most prevalent disease to females in the worldwide. Its pathology remains unclear. Genetics factors is the ways to understand the molecular mechanism. This paper proposed a computational approach to explore the interactions of genes2genes related to breast cancer. We first defined the interactions of genes2genes, and described the representation of interactions of genes2genes. Using the experimental dataset, we implemented the proposed approach for extracting the interactions of genes2genes. Moreover, we also represented the interactions of genes2genes in two forms: relationship matrix and network visualization. By manual analysis, we extracted the interactions of top 10 genes2genes is related to breast cancer, which show the approach is promising for studying molecular mechanism related to breast cancer.

关键词： Breast cancer Pipelines data mining Manuals Genetics

来源：评论

学校读者我要写书评

暂无评论

Universal deep network for steganalysis of color image based on channel representation

arXiv

引用

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Consistent and Complementary Graph Regularized Multi-view Subspace Clustering

arXiv

引用

arXiv 2020年

作者： Zheng, Qinghai Zhu, Jihua Li, Zhongyu Pang, Shanmin Wang, Jun Chen, Lei School of Software Engineering Xi’an Jiaotong University Xi’an710049 China Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200444 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. Exploration of all information is crucial for good multi-view clustering. However, most traditional methods blindly or crudely combine multiple views for clustering and are unable to fully exploit the valuable information. Therefore, we propose a method that involves consistent and complementary graph-regularized multi-view subspace clustering (GRMSC), which simultaneously integrates a consistent graph regularizer with a complementary graph regularizer into the objective function. In particular, the consistent graph regularizer learns the intrinsic affinity relationship of data points shared by all views. The complementary graph regularizer investigates the specific information of multiple views. It is noteworthy that the consistent and complementary regularizers are formulated by two different graphs constructed from the first-order proximity and second-order proximity of multiple views, respectively. The objective function is optimized by the augmented Lagrangian multiplier method in order to achieve multi-view clustering. Extensive experiments on six benchmark datasets serve to validate the effectiveness of the proposed method over other state-of-the-art multi-view clustering methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

Proceedings of the 36th International Conference on Neural Information processing Systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

arXiv

引用

arXiv 2021年

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China University of Texas at Dallas Dallas United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. © 2021, CC0.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

PhotoRedshift-MML: a multimodal machine learning method for estimating photometric redshifts of quasars

arXiv

引用

arXiv 2022年

作者： Hong, Shuxin Zou, Zhiqiang Luo, A-Li Kong, Xiao Yang, Wenyu Chen, Yanli College of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China CAS Key Laboratory of Optical Astronomy National Astronomical Observatories Beijing100101 China School of Astronomy and Space Science University of Chinese Academy of Sciences Beijing100049 China

We propose a Multimodal Machine Learning method for estimating the Photometric Redshifts of quasars (PhotoRedshift-MML for short), which has long been the subject of many investigations. Our method includes two main models, i.e. the feature transformation model by multimodal representation learning, and the photometric redshift estimation model by multimodal transfer learning. The prediction accuracy of the photometric redshift was significantly improved owing to the large amount of information offered by the generated spectral features learned from photometric data via the MML. A total of 415,930 quasars from Sloan Digital Sky Survey (SDSS) data Release 17, with redshifts between 1 and 5, were screened for our experiments. We used |Δz| = |(zphot− zspec)/(1 + zspec)| to evaluate the redshift prediction and demonstrated a 4.04% increase in accuracy. With the help of the generated spectral features, the proportion of data with |Δz| Copyright © 2022, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：