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

RankFIRST: Visual Analysis for Factor Investment By Ranking Stock Timeseries

IEEE Transactions on Visualization and Computer Graphics 2022年 PP卷 1-10页

作者： Guo, Huijie Liu, Meijun Yang, Bowen Sun, Ye Qu, Huamin Shi, Lei SKLSDE and Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University China Hong Kong University of Science and Technology Hong Kong

In the era of quantitative investment, factor-based investing models are widely adopted in the construction of stock portfolios. These models explain the performance of individual stocks by a set of financial factors, e.g., market beta and company size. In industry, open investment platforms allow the online building of factor-based models, yet set a high bar on the engineering expertise of end-users. State-of-the-art visualization systems integrate the whole factor investing pipeline, but do not directly address domain users' core requests on ranking factors and stocks for portfolio construction. The current model lacks explainability, which downgrades its credibility with stock investors. To fill the gap in modeling, ranking, and visualizing stock time series for factor investment, we designed and implemented a visual analytics system, namely RankFIRST. The system offers built-in support for an established factor collection and a cross-sectional regression model viable for human interpretation. A hierarchical slope graph design is introduced according to the desired characteristics of good factors for stock investment. A novel firework chart is also invented extending the well-known candlestick chart for stock time series. We evaluated the system on the full-scale Chinese stock market data in the recent 30 years. Case studies and controlled user evaluation demonstrate the superiority of our system on factor investing, in comparison to both passive investing on stock indices and existing stock market visual analytics tools. IEEE

关键词： Investments

来源：评论

学校读者我要写书评

暂无评论

AccelES: Accelerating Top-K SpMV for Embedding Similarity via Low-bit Pruning 31

AccelES: Accelerating Top-K SpMV for Embedding Similarity vi...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Zhai, Jiaqi Shi, Xuanhua Huang, Kaiyi Ye, Chencheng Hu, Weifang He, Bingsheng Jin, Hai Huazhong University of Science and Technology 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 Wuhan430074 China National University of Singapore School of Computing 119077 Singapore

ISBN: (纸本)9798331506476

In the realm of recommendation systems, achieving real-time performance in embedding similarity tasks is often hindered by the limitations of traditional Top-K sparse matrix-vector multiplication (SpMV) methods, which suffer from high latency due to inefficient memory access patterns. This paper identifies these critical gaps and introduces AccelES, a novel approach that significantly enhances the efficiency of Top-K SpMV. Our method employs a two-stage calculation scheme: the first stage utilizes a compact, low-bit dataset to quickly identify the most relevant entries, while the second stage performs full-precision calculations solely on this pruned subset, thereby minimizing computational overhead. Furthermore, AccelES incorporates innovative matrix representations, Ultra-CSR and Random-CSR, which optimize memory bandwidth utilization. Experimental results demonstrate that AccelES accelerates performance, surpassing state-of-the-art FPGA, GPU, and CPU solutions by factors of 3.4×, 2.5×, and 153.3×, respectively, under controlled conditions. These advancements not only enhance processing speed but also significantly improve real-time performance in recommendation systems, establishing AccelES as a pivotal contribution to the field of Top-K sparse matrix-vector multiplication. © 2025 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Efficient and Verifiable Multi-server Framework for Secure Information Classification and Storage 20th

Efficient and Verifiable Multi-server Framework for Secure...

引用

20th International Conference on Information Security and Cryptology, Inscrypt 2024

作者： Guo, Ziqing Wang, Yaohui Jin, Xuanyu Wang, Xiuhua He, Yuanyuan Dai, Yueyue Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9789819647330

With the rapid development of digital technology, the complexity and diversity of data sources present significant security and privacy challenges. To address these issues, this paper proposes an efficient and verifiable Multi-Server Framework for Secure Information Classification and Storage (MSF-SCS). The framework distributes sensitive data across multiple servers, proposing an opening authority to manage classified information and a semi-honest sanitizer to ensure strong authentication while preserving user anonymity. We formalize the security model of our scheme and prove that it satisfies the no-read rule, no-write rule, and unforgeability. We instantiate the scheme and conduct comprehensive experimental evaluations, which demonstrate that MSF-SCS significantly outperforms traditional architectures in terms of scalability and efficiency, making it particularly suitable for industries with stringent data protection requirements. Future work will focus on further improving the system’s security while maintaining its high performance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Sparse regularization based feature selection: A survey 10

Sparse regularization based feature selection: A survey

引用

10th International Conference on Information technology and Quantitative Management, ITQM 2023

作者： Zhao, Jingjing Liu, Yashu Cheng, Li Zhang, Maoqing Jiang, Mengwan Miao, Jianyu College of Information Science and Engineering Henan University of Technology Zhengzhou450001 China School of Artificial Intelligence and Big Data Henan University of Technology Zhengzhou450001 China

Feature selection, as an essential preprocessing tool, aims to identify a subset of crucial features by eliminating redundant and noisy features according to a predefined criterion. In recent years, sparse learning has received considerable attention. As an important component of sparse learning, sparse regularization has been widely used in feature selection to enforce irrelevant feature coefficients to be small or exactly zero, which is especially suitable for selecting the discriminative and relevant features. In this paper, we attempt to provide a survey on various sparse regularization based methods. We group the existing sparse regularization based methods into two categories, i.e., convex sparse regularization based feature selection and non-convex sparse regularization based feature selection. This survey not only compares the common and different characters of sparse regularizations based feature selection methods, but also offers useful guidance for practitioners of feature selection. © 2023 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0) Peer-review under responsibility of the scientific committee of the Tenth International Conference on Information technology and Quantitative Management.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Intelligent Blocking and Prevention of SARS-CoV-2 Based on Evolutionary Reinforcement Learning 13

Intelligent Blocking and Prevention of SARS-CoV-2 Based on E...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： He, Chengwei Hong, Huaping Ma, Lijia Zhu, Qingling Bai, Yuan College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

ISBN: (纸本)9798350308365

In recent years, the global repercussions of SARS-CoV-2 and its variants have posed significant challenges to various areas, including the economic order, transportation, healthcare, and education, and the mitigation and prevention of SARS-CoV-2 and other infectious diseases have received much attention. This paper tries to develop a rational and effective intervention strategy in response to the dynamic evolution of the SARS-CoV-2 epidemic. To address this issue, we first use the SEIR model to analyze the population distribution under the SARS-CoV-2 epidemic, and then integrate a deep Q-neural network (DQN) to reflect an economic quantification model contextualized within the SARS-CoV-2 scenario. Next, we propose an evolutionary deep reinforcement learning to generate an optimal and adaptive intervention strategy, by optimizing the weight sequence of the DQN. The experimental results show the effectiveness of the proposed method in maximizing economic benefits, while ensuring the uninterrupted functionality of medical institutions. Importantly, the learned intervention strategy exhibits the applicability to other infectious diseases. © 2024 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Machine Learning is All You Need: A Simple Token-Based Approach for Effective Code Clone Detection 24

Machine Learning is All You Need: A Simple Token-Based Appro...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Feng, Siyue Suo, Wenqi Wu, Yueming Zou, Deqing Liu, Yang Jin, Hai Huazhong University of Science and Technology China Nanyang Technological University Singapore Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Jinyinhu Laboratory Wuhan430074 China School of Cyber Science and Engineering Hust Wuhan430074 China School of Computer Science and Technology Hust Wuhan430074 China

ISBN: (纸本)9798400702174

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used bigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings. © 2024 ACM.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

LQTTrack:Multi-Object Tracking by Focusing on Low-Quality Targets Association

引用

Computers, Materials & Continua 2024年第10期81卷 1449-1470页

作者： Suya Li Ying Cao Hengyi Ren Dongsheng Zhu Xin Xie Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information EngineeringHenan UniversityKaifeng475001China College of Information Science and Technology&Artificial Intelligence Nanjing Forestry UniversityNanjing210037China School of Computer Nanjing University of Posts and TelecommunicationsNanjing210023China

Multi-object tracking(MOT)has seen rapid improvements in recent ***,frequent occlusion remains a significant challenge in MOT,as it can cause targets to become smaller or disappear entirely,resulting in lowquality targets,leading to trajectory interruptions and reduced tracking *** from some existing methods,which discarded the low-quality targets or ignored low-quality target ***,with a lowquality association strategy(LQA),is proposed to pay more attention to low-quality *** the association scheme of LQTTrack,firstly,multi-scale feature fusion of FPN(MSFF-FPN)is utilized to enrich the feature information and assist in subsequent data ***,the normalized Wasserstein distance(NWD)is integrated to replace the original Inter over Union(IoU),thus overcoming the limitations of the traditional IoUbased methods that are sensitive to low-quality targets with small sizes and enhancing the robustness of low-quality target ***,the third association stage is proposed to improve the matching between the current frame’s low-quality targets and previously interrupted trajectories from earlier frames to reduce the problem of track fragmentation or error tracking,thereby increasing the association success rate and improving overall multi-object tracking *** experimental results demonstrate the competitive performance of LQTTrack on benchmark datasets(MOT17,MOT20,and DanceTrack).

关键词： Low-quality targets association strategy feature fusion multi-object tracking tracking-by-detection

来源：评论

学校读者我要写书评

暂无评论

LogADCH: Hyperspheric-Based Log Message Anomaly Detection And Classification

LogADCH: Hyperspheric-Based Log Message Anomaly Detection An...

引用

2023 International Conference on Frontiers of Robotics and Software Engineering, FRSE 2023

作者： He, Shiming Xiao, Jinpan Chen, Bowen Lei, Ying Changsha University of Science & Technology School of Computer and Communication Engineering The Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha China

ISBN: (纸本)9798350301113

Web services have been integrated with all walks of life in society. Abnormalities in the network and services seriously affect user experience and company revenue. The system log records various information of the system, and the information-rich log messages usually show different anomalies. It is particularly important to accurately and timely identify the anomalies of the log messages and classify the anomalies. In addition, most of the current existing work only detects anomalies and does not classify them, and a few existing works require anomaly labels to classify anomalies. Based on these potential challenges, we propose an unsupervised hypersphere-based log message anomaly detection and classification method, LogADCH. We use the hypersphere loss function to let the BERT model learn compact representations of log messages and perform anomaly detection. Finally, K-Means clustering is performed on the semantic feature vectors detected as anomalies to form clusters of different types of anomalies. Compared with other works, LogADCH further classifies the abnormal types after detecting the abnormal logs, helping the operation and maintenance personnel to quickly locate the fault. We compare our method with other methods on two public datasets, and the experimental results show that LogADCH has superior performance in anomaly detection as well as anomaly classification. © 2023 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Research on Facial Expression Recognition Method Based on Improved VGG16 Network 7

Research on Facial Expression Recognition Method Based on Im...

引用

7th IEEE Information technology and Mechatronics Engineering Conference, ITOEC 2023

作者： Luo, Xiaoshu Xu, Zhaoxing Feng, Fangyu Jiangxi Institute of Fashion Technology College of Big Data Science Nanchang China Guangxi Normal University School of Electronic and Information Engineering Guilin China

ISBN: (纸本)9798350334197

For the insufficient extraction of facial expression features by convolutional neural network VGG16, an improved VGG16-NFB network model is proposed to extract facial expression features more fully, so as to improve the accuracy of facial expression recognition. Firstly, VGG16 is used to optimize the network structure, and the part before the classifier is used as the feature extractor to extract the features of facial expressions initially, and the redundant two full connection layers in the classifier are deleted. Then, a feature enhancement module FEM is designed, in which the representative batch normalization method can calibrate the feature information effectively, make the feature distribution more stable, and further enhance the network's ability to extract features from facial expressions. Finally, the global average pooling is used to extract the features of each level in the feature enhancement module, and the bridge attention module BAM is introduced to fuse the features of each level, which is used to generate attention weights to further enhance the facial expression features with high discrimination. The experimental results show that the improved VGG16-NFB network achieves 86.8% and 87.5% recognition accuracy on the RAF-DB and FERPlus facial expression datasets, respectively, which is 2.22% and 1.61% higher than the original network. © 2023 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

IMDENCLUE: An Improved DENCLUE Clustering Based On Kernel Density Estimation Optimisation And Cluster Merging Strategy 12

IMDENCLUE: An Improved DENCLUE Clustering Based On Kernel De...

引用

12th IEEE International Conference on Intelligent data Acquisition and Advanced Computing Systems: technology and Applications, IDAACS 2023

作者： Ye, Zhiwei Lv, Jiazhi Liu, Yuanhu Liu, Yingying Wu, Zhenwei Bai, Wanfang School of Computer Science Hubei University of Technology China Fiberhome Telecommunication Technologies CO Ltd China Xining Big Data Service Administration China

ISBN: (纸本)9798350358056

As a representative of density-based method, DENCLUE discovers the density-attractors of data using Hill Climbing (HC), if there exists a path between significant density-attractors, data points belonging to those attractors are grouped as one cluster. However, it is very difficult to select the appropriate influence parameter and the density-attractor significance for the DENCLUE. In this paper, we propose a kernel density estimation (KDE) optimization and a cluster merging strategy for improving the performance of the traditional DENCLUE. Asymptotic mean integrated square error (AMISE) of standard KDE is introduced to calculate the optimal window width. It can help to obtain the correct global possibility density, which will lead to accurate HC results. Fine reconstruction of data as well as outlier detection will be accomplished by an optimized threshold firstly. Then, boundary density between two fine clusters is evaluated for merging purposes, which can reorganize fine-grained groups. Experiment results show that we can improve the clustering performance by using the optimized KDE and the merging strategy. Compared with the traditional DENCLUE and DBSCAN, our method gains a higher clustering performance on the data with arbitrary shapes and sizes. © 2023 IEEE.

关键词： AMISE Cluster merging DENCLUE KDE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：