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

2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019

作者： Chen, Qiaosong Wang, Zhixiang Long, Baijun Sui, Xiaoxu Zhang, Meng Deng, Xin Wang, Jin Chongqing University of Posts and Telecommunications Key Laboratory of Data Engineering and Visual Computing Chongqing400065 China Streamax AI Lab Streamax Chongqing400039 China

ISBN: (纸本)9781728145693

Lane detection task is the most necessary part in modern intelligent driving technology. However, there still have many challenge need to be conquered. In this paper, we proposed a three-branch neural network, in this framework, there are several new techniques are used. Including multi-branch, lightweight module, feature recalibration and decoder module, named Three Branch Net. Furthermore, A new dataset have been used, which includes much more complex situation and more close to the real world. Compared with other newest method, experiment results shows the proposed approach is the most effective method in complex road conditions task. © 2019 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

FedCAPrivacy: Privacy-Preserving Heterogeneous Federated Learning with Anonymous Adaptive Clustering

arXiv

引用

arXiv 2025年

作者： Wei, Yunan Zhao, Shengnan Zhao, Chuan Liu, Zhe Chen, Zhenxiang Zhao, Minghao Shandong Key Laboratory of Ubiquitous Intelligent Computing University of Jinan Jinan250022 China Quan Cheng Laboratory Jinan250103 China Zhejiang Laboratory Hangzhou311121 China School of Data Science and Engineering East China Normal University Shanghai200050 China

Federated learning (FL) is a distributed machine learning paradigm enabling multiple clients to train a model collaboratively without exposing their local data. Among FL schemes, clustering is an effective technique addressing the heterogeneity issue (i.e., differences in data distribution and computational ability affect training performance and effectiveness) via grouping participants with similar computational resources or data distribution into clusters. However, intra-cluster data exchange poses privacy risks, while cluster selection and adaptation introduce challenges that may affect overall performance. To address these challenges, this paper introduces anonymous adaptive clustering, a novel approach that simultaneously enhances privacy protection and boosts training efficiency. Specifically, an oblivious shuffle-based anonymization method is designed to safeguard user identities and prevent the aggregation server from inferring similarities through clustering. Additionally, to improve performance, we introduce an iteration-based adaptive frequency decay strategy, which leverages variability in clustering probabilities to optimize training dynamics. With these techniques, we build the FedCAPrivacy;experiments show that FedCAPrivacy achieves ∼ 7× improvement in terms of performance while maintaining high privacy. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Mining Repetitive Negative Sequential Patterns with Gap Constraints

引用

ACM Transactions on Knowledge Discovery from data 2025年第4期19卷

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin China School of Artificial Intelligence Hebei University of Technology Tianjin China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Hebei Key Laboratory of Big Data Computing Tianjin China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this article explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner but also verify that NSPG-Miner can discover more valuable information than the state-of-the-art algorithms. Copyright © 2025 held by the owner/author(s). Publication rights licensed to ACM.

关键词： gap constraint key-value pair negative sequential pattern sequential pattern mining

来源：评论

学校读者我要写书评

暂无评论

Time-aware conversion prediction

引用

Frontiers of Computer Science 2017年第4期11卷 702-716页

作者： Wendi JI Xiaoling WANG Feida ZHU Shanghai Key Laboratory of Trustworthy Computing Institute for Data Science and Engineering East China Normal University Shanghai 200062 China School of Information Systems Singapore Management University Singapore 188065 Singapore

The importance of product recommendation has been well recognized as a central task in business intelligence for e-commerce websites. Interestingly, what has been less aware of is the fact that different products take different time periods for conversion. The ＂conversion＂ here refers to actu- ally a more general set of pre-defined actions, including for example purchases or registrations in recommendation and advertising systems. The mismatch between the product＇s ac- tual conversion period and the application＇s target conversion period has been the subtle culprit compromising many exist- ing recommendation algorithms. The challenging question： what products should be recom- mended for a given time period to maximize conversion--is what has motivated us in this paper to propose a rank-based time-aware conversion prediction model （rTCP）, which con- siders both recommendation relevance and conversion time. We adopt lifetime models in survival analysis to model the conversion time and personalize the temporal prediction by incorporating context information such as user preference. A novel mixture lifetime model is proposed to further accom- modate the complexity of conversion intervals. Experimental results on two real-world data sets illustrate the high good- ness of fit of our proposed model rTCP and demonstrate its effectiveness in time-aware conversion rate prediction for ad- vertising and product recommendation.

关键词： conversion time survival analysis product rec-ommendation advertising

来源：评论

学校读者我要写书评

暂无评论

Randomized Latent Factor Model for High-dimensional and Sparse Matrices from Industrial Applications

引用

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 131-141页

作者： Mingsheng Shang Xin Luo Zhigang Liu Jia Chen Ye Yuan MengChu Zhou the Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent ComputingChongqing Institute of Green and Intelligent TechnologyChinese Academy of Sciences the School of Computer Science and Engineering Beihang University the Department of Electrical and Computer Engineering New Jersey Institute of Technology

Latent factor(LF) models are highly effective in extracting useful knowledge from High-Dimensional and Sparse(HiDS) matrices which are commonly seen in various industrial applications. An LF model usually adopts iterative optimizers,which may consume many iterations to achieve a local optima,resulting in considerable time cost. Hence, determining how to accelerate the training process for LF models has become a significant issue. To address this, this work proposes a randomized latent factor(RLF) model. It incorporates the principle of randomized learning techniques from neural networks into the LF analysis of HiDS matrices, thereby greatly alleviating computational burden. It also extends a standard learning process for randomized neural networks in context of LF analysis to make the resulting model represent an HiDS matrix *** results on three HiDS matrices from industrial applications demonstrate that compared with state-of-the-art LF models, RLF is able to achieve significantly higher computational efficiency and comparable prediction accuracy for missing data.I provides an important alternative approach to LF analysis of HiDS matrices, which is especially desired for industrial applications demanding highly efficient models.

关键词： Big data high-dimensional and sparse matrix latent factor analysis latent factor model randomized learning

来源：评论

学校读者我要写书评

暂无评论

User Heterogeneity and Individualized Recommender

引用

Chinese Physics Letters 2017年第6期34卷 135-138页

作者：王庆先张君杰史晓雨尚明生 School of Information and Software Engineering University of Electronic Science and Technology of China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of Sciences

Previous works on personalized recommendation mostly emphasize modeling peoples＇ diversity in potential fa- vorites into a uniform recommender. However, these recommenders always ignore the heterogeneity of users at an individual level. In this study, we propose an individualized recommender that can satisfy every user with a customized parameter. Experimental results on four benchmark datasets demonstrate that the individualized recommender can significantly improve the accuracy of recommendation. The work highlights the importance of the user heterogeneity in recommender design.

关键词： User Heterogeneity and Individualized Recommender

来源：评论

学校读者我要写书评

暂无评论

Collusion-Proof Result Inference in Crowdsourcing

引用

Journal of Computer Science & Technology 2018年第2期33卷 351-365页

作者： Peng-Peng Chen Hai-Long Sun Yi-Li Fang Jin-Peng Huai State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing 100191 China

In traditional crowdsourcing, workers are expected to provide independent answers to tasks so as to ensure the diversity of answers. However, recent studies show that the crowd is not a collection of independent workers, but instead that workers communicate and collaborate with each other. To pursue more rewards with little effort, some workers may collude to provide repeated answers, which will damage the quality of the aggregated results. Nonetheless, there are few efforts considering the negative impact of collusion on result inference in crowdsourcing. In this paper, we are specially concerned with the Collusion-Proof result inference problem for general crowdsourcing tasks in public platforms. To that end, we design a metric, the worker performance change rate, to identify the colluded answers by computing the difference of the mean worker performance before and after removing the repeated answers. Then we incorporate the collusion detection result into existing result inference methods to guarantee the quality of the aggregated results even with the occurrence of collusion behaviors. With real-world and synthetic datasets, we conducted an extensive set of evaluations of our approach. The experimental results demonstrate the superiority of our approach in comparison with the state-of-the-art methods.

关键词： crowdsourcing quality control collusion collaborative crowdsourcing result inference

来源：评论

学校读者我要写书评

暂无评论

Interest Points Analysis for Internet Forum Based on Long-Short Windows Similarity

引用

Computers, Materials & Continua 2022年第8期72卷 3247-3267页

作者： Xinghai Ju Jicang Lu Xiangyang Luo Gang Zhou Shiyu Wang Shunhang Li Yang Yang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China School of Computing and Information Systems Singapore Management University188065Singapore College of Computer Science and Big Data Fuzhou UniversityFuzhou350116China

For Internet forum Points of Interest(PoI),existing analysis methods are usually lack of usability analysis under different conditions and ignore the long-term variation,which lead to blindness in method *** address this problem,this paper proposed a PoI variation prediction framework based on similarity analysis between long and short *** on the framework,this paper presented 5 PoI analysis algorithms which can be categorized into 2 types,i.e.,the traditional sequence analysis methods such as autoregressive integrated moving average model(ARIMA),support vector regressor(SVR),and the deep learning methods such as convolutional neural network(CNN),long-short term memory network(LSTM),Transformer(TRM).Specifically,this paper firstly divides observed data into long and short windows,and extracts key words as PoI of each ***,the PoI similarities between long and short windows are calculated for training and ***,series of experiments is conducted based on real Internet forum *** results show that,all the 5 algorithms could predict PoI variations well,which indicate effectiveness of the proposed *** the length of long window is small,traditional methods perform better,and SVR is the *** the contrary,the deep learning methods show superiority,and LSTM performs *** results could provide beneficial references for PoI variation analysis and prediction algorithms selection under different parameter configurations.

关键词： Point of interest(PoI)analysis long and short windows sequential analysis deep learning

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection based on Markov blanket and particle swarm optimization

引用

Journal of Systems engineering and Electronics 2017年第1期28卷 151-161页

作者： Yintong Wang Jiandong Wang Hao Liao Haiyan Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University College of Computer Science and Software Engineering Shenzhen University

Feature selection plays an important role in data mining and recognition, especially in the large scale text, image and biological data. Specifically, the class label information is unavailable to guide the selection of minimal feature subset in unsupervised feature selection, which is challenging and interesting. An unsupervised feature selection based on Markov blanket and particle swarm optimization is proposed named as UFSMB-PSO. The proposed method seeks to find the high-quality feature subset through multi-particles' cooperation of particle swarm optimization without using any learning algorithms. Moreover, the features' relevance will be computed based on an information metric of relevance gain, which provides an information theoretical foundation for finding the minimization of the redundancy between features. Our results on several benchmark datasets demonstrate that UFSMB-PSO can achieve significant improvement over state of the art unsupervised methods. © 1990-2011 Beijing Institute of Aerospace Information.

关键词： Character recognition data mining Feature extraction Information theory

来源：评论

学校读者我要写书评

暂无评论

A Cross-Domain Ontology Semantic Representation Based on NCBI-BlueBERT Embedding

引用

Chinese Journal of Electronics 2022年第5期31卷 860-869页

作者： ZHAO Lingling WANG Junjie WANG Chunyu GUO Maozu Faculty of Computing Harbin Institute of Technology Department of Medical Informatics School of Biomedical Engineering and InformaticsNanjing Medical University Beijing Key Laboratory of Intelligent Processing for Building Big Data School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture

A common but critical task in biological ontologies data analysis is to compare the difference between ontologies. There have been numerous ontologybased semantic-similarity measures proposed in specific ontology domain, but it still remains a challenge for crossdomain ontologies comparison. An ontology contains the scientific natural language description for the corresponding biological aspect. Therefore, we develop a new method based on natural language processing(NLP) representation model bidirectional encoder representations from transformers(BERT) for cross-domain semantic representation of biological ontologies. This article uses the BERT model to represent the word-level of the ontologies as a set of vectors, facilitating the semantic analysis or comparing the biomedical entities named in an ontology or associated with ontology terms. We evaluated the ability of our method in two experiments: calculating similarities of pair-wise disease ontology and human phenotype ontology terms and predicting the pair-wise of proteins interaction. The experimental results demonstrated the comparative performance. This gives promise to the development of NLP methods in biological data analysis.

关键词： human phenotype ontology cross-domain semantic representation natural language description pair-wise disease ontology data analysis bidirectional encoder representations NLP protein interaction diseases proteins natural language processing ontologies (artificial intelligence) natural language processing representation neural nets bioinformatics semantic-similarity measures cross-domain ontology semantic representation semantic analysis NCBI-BlueBERT embedding biological ontology data analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：