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

SSRN 2024年

作者： Hao, Jia Deng, Ruofan Jia, Liangyue Li, Zuoxuan Industrial and Systems Engineering Laboratory Beijing Institute of Technology Beijing100081 China Yangtze Delta Region Academy of Beijing Institute of Technology Jiaxing314019 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China

Automatic optimization algorithms play an important role in vehicle body lightweight design;however, the existing methods are still inefficient and result in excessive iterations that escalate both time and costs. Current interactive optimization strategies partially mitigate this issue but fall short in offering a broad spectrum of manipulation points and auxiliary information model, essential for optimizing design efficiency and accuracy. As such, we introduce a novel approach, "Human-in-the-Loop based method for Vehicle Body Lightweight Design" (HIL-VBLD). This method seamlessly integrates human decision-making with optimization algorithms to reduce unproductive iterations. HIL-VBLD comprises two key components: (1) a novel interaction mode offering multiple manipulation points including constraint modification, algorithm switching, and selection of solutions of interest (SOI);(2) A comprehensive auxiliary information model aids in decision-making for designers. Our analysis underscores HIL-VBLD's efficacy, evidenced by a 54.5% reduction in iteration cycles for genetic algorithm using SOI selection. Algorithm switching led to a 4.5% mass reduction, circumventing local optimum pitfalls associated with gradient algorithms. Additionally, the auxiliary information model contributed to a further 1.25% mass reduction, enhancing optimization robustness. Compared to conventional automatic algorithm switching strategies, HIL-VBLD maintains equivalent accuracy with 23.9% fewer iterations. © 2024, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

MTSC-GE: A Novel Graph based Method for Multivariate Time Series Clustering 12

MTSC-GE: A Novel Graph based Method for Multivariate Time Se...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Yang, Ze Tai, Changyang Wu, Gongqing Zhang, Zan Bao, Xianyu Key Laboratory of Knowledge Engineering With Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

ISBN: (纸本)9781665438582

Few clustering methods show good performance on multivariate time series (MTS) data. Traditional methods rely too much on similarity measures and perform poorly on the MTS data with complex structures. This paper proposes an MTS clustering algorithm based on graph embedding called MTSC-GE to improve the performance of MTS clustering. MTSC-GE can map MTS samples to the feature representations in a low-dimensional space and then cluster them. While mining the information of the samples themselves, MTSC-GE builds the whole time series data into a graph, paying attention to the connections between samples from an overall perspective and discovering the local structural feature of MTS data. The proposed MTSC-G E consists of three stages. The first stage builds a graph using the original dataset, where each of the MTS samples is regarded as a node in the graph. The second stage uses the graph embedding technique to obtain a new representation of each node. Finally, MTSC-G E uses the K - Means algorithm to cluster based on the newly obtained representation. We compare MTSC-GE with six state-of-the-art benchmark methods on five public datasets, experimental results show that MTSC-GE has achieved good performance. © 2021 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

DAGKT: Difficulty and Attempts Boosted Graph-based knowledge Tracing

arXiv

引用

arXiv 2022年

作者： Luo, Rui Liu, Fei Liang, Wenhao Zhang, Yuhong Bu, Chenyang Hu, Xuegang Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China School of Computer Science and Information Engineering Hefei University of Technology China Jianzai Tech Hefei China

In the field of intelligent education, knowledge tracing (KT) has attracted increasing attention, which estimates and traces students’ mastery of knowledge concepts to provide high-quality education. In KT, there are natural graph structures among questions and knowledge concepts so some studies explored the application of graph neural networks (GNNs) to improve the performance of the KT models which have not used graph structure. However, most of them ignored both the questions’ difficulties and students’ attempts at questions. Actually, questions with the same knowledge concepts have different difficulties, and students’ different attempts also represent different knowledge mastery. In this paper, we propose a difficulty and attempts boosted graph-based KT (DAGKT)3, using rich information from students’ records. Moreover, a novel method is designed to establish the question similarity relationship inspired by the F1 score. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed DAGKT. Copyright © 2022, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

SALI: A Scalable Adaptive Learned Index Framework based on Probability Models

arXiv

引用

arXiv 2023年

作者： Ge, Jiake Zhang, Huanchen Shi, Boyu Luo, Yuanhui Guo, Yunda Chai, Yunpeng Chen, Yuxing Pan, Anqun Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China School of Information Renmin University of China China China and Shanghai Qi Zhi Institute China Tsinghua University China Tencent Inc China

The growth in data storage capacity and the increasing demands for high performance have created several challenges for concurrent indexing structures. One promising solution is learned indexes, which use a learning-based approach to fit the distribution of stored data and predictively locate target keys, significantly improving lookup performance. Despite their advantages, prevailing learned indexes exhibit constraints and encounter issues of scalability on multi-core data storage. This paper introduces SALI, the Scalable Adaptive Learned Index framework, which incorporates two strategies aimed at achieving high scalability, improving efficiency, and enhancing the robustness of the learned index. Firstly, a set of node-evolving strategies is defined to enable the learned index to adapt to various workload skews and enhance its concurrency performance in such scenarios. Secondly, a lightweight strategy is proposed to maintain statistical information within the learned index, with the goal of further improving the scalability of the index. Furthermore, to validate their effectiveness, SALI applied the two strategies mentioned above to the learned index structure that utilizes fine-grained write locks, known as LIPP. The experimental results have demonstrated that SALI significantly enhances the insertion throughput with 64 threads by an average of 2.04× compared to the second-best learned index. Furthermore, SALI accomplishes a lookup throughput similar to that of LIPP+. © 2023, CC BY-NC-ND.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Gaussian Model-Based Fully Convolutional Networks for Multivariate Time Series Classification 12

Gaussian Model-Based Fully Convolutional Networks for Multiv...

引用

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Tai, Changyang Yang, Ze Zhang, Huicheng Wu, Gongqing Lv, Junwei Bao, Xianyu Key Laboratory of Knowledge Engineering With Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

ISBN: (纸本)9781665438582

Multivariate time series (MTS) classification has been regarded as one of the most challenging problems in data mining due to the difficulty in modeling the correlation of variables and samples. In addition, high-dimensional MTS modeling has a large time and space consumption. This paper proposes a novel method, Gaussian Model-based Fully Convolutional Networks (GM-FCN), to improve the performance of high-dimensional MTS classification. Each original MTS is converted into multivariate Gaussian model parameters as the input of FCN. These parameters effectively capture the correlation be-tween MTS variables and significantly reduce the data scale by aligning an MTS size to its dimension. FCN is designed to learn more in-depth features of MTS based on these parameters for modeling the correlation between samples. Thus, GM-FCN can not only model the correlation between variables, but also the correlation between samples. We compare GM-FCN with nine state-of-the-art MTS classification methods, INN-ED, INN-DTW-i, INN-DTW-D, KLD-GMC, MLP, ResNet, Encoder, MCNN, and MCDCNN, on four high-dimensional public datasets, experimen-tal results show that the accuracy of G M - FCN is significantly superior to the others. Besides, the training time of GM-FCN is dozens of times faster than FCN using the original equal-length MTS data as input. © 2021 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 41

Size-Invariance Matters: Rethinking Metrics and Losses for I...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright 2024 by the author(s)

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 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 paper 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-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

A Deletable and Modifiable Blockchain Scheme Based on Record Verification Trees and the Multisignature Mechanism

引用

Computer Modeling in engineering & Sciences 2021年第7期128卷 223-245页

作者： Daojun Han Jinyu Chen Lei Zhang Yatian Shen Yihua Gao Xueheng Wang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng47500China Institute of Data and Knowledge Engineering Henan UniversityKaifeng47500China School of Computer and Information Engineering Henan UniversityKaifeng47500China Department of Network and Finance Agricultural Bank of China Limited Xuchang BranchXuchang461000China School of Software Pingdingshan UniversityPingdingshan467000China Department of Network and Finance Agricultural Bank of China Limited Nanyang BranchNanyang473000China

As one of the most valuable technologies,blockchains have received extensive attention from researchers and industry circles and are widely applied in various ***,data on a blockchain cannot be *** a result,it is impossible to clean invalid and sensitive data and correct erroneous ***,to a certain extent,hinders the application of blockchains in supply chains and Internet of *** address this problem,this study presents a deletable and modifiable blockchain scheme(DMBlockChain)based on record verification trees(RVTrees)and the multisignature scheme.(1)In this scheme,an RVTree structure is designed and added to the block *** RVTree can not only ensure that a record is true and valid but,owing to its unique binary structure,also verify whether modification and deletion requests are valid.(2)In DMBlockChain,the multisignature mechanism is also *** mechanism requires the stakeholders’signatures for each modification or deletion request and thus ensures that a record will not be modified arbitrarily.A user’s request is deemed valid only if it is dually verified by the RVTree and the multisignature *** analysis finds that DMBlockChain can provide a secure and valid means for modifying and deleting records in a block while ensuring the integrity of the block and that DMBlockChain can effectively save space in some scenarios that require frequent records modification.

关键词： Blockchain record verification trees multisignature DMBlockChain

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

arXiv

引用

arXiv 2024年

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Preference Completion with Ranked and Unranked Preferences

引用

Cognitive Computation 2025年第3期17卷 1-21页

作者： Li, Lei Liu, Pan Zhang, Renjie Tao, Zhenchao Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Radiation Oncology The First Affiliated Hospital of USTC Division of Life Sciences and Medicine University of Science and Technology of China Hefei China Department of Radiation Oncology Anhui Provincial Cancer Hospital Hefei China

As for social choice, all alternatives are ranked by agents to form preferences as linear orders. However, in applications, sometimes some alternatives cannot be ranked, or it is unnecessary to rank them, which leads to unranked alternatives. Hence, without loss of generality, by dividing the set of alternatives into three ranked and unranked subsets, including top-k alternatives, intermediate-r alternatives, and last-l alternatives, the Mallows model on ranked and unranked preferences can be analyzed systematically. Technically, a repeated insertion model is adopted during sampling, and probability distributions are derived for ranked and unranked preferences of alternatives. Experimental results verify the accuracy of the probability distributions for different ranked and unranked preferences of alternatives. Furthermore, in order to solve the preference completion problem where agents have multiple partial rankings, a fuzzy preference completion algorithm, Fuzzy-Multi-Rankings, is proposed, which introduces a fuzzy ranking to complete the target agent’s preference in addition to the traditional nearest-neighbor-based methods. Based on the three ranked and unranked preferences, seven cases can be classified and analyzed for fuzzy preference completion. Experiments on the synthetic datasets and MovieLens dataset confirm the effectiveness and efficiency of our proposed Fuzzy-Multi-Rankings algorithm and also verify the accuracy of the evaluated probability distributions for the proposed seven cases.

关键词： Mallows model Unranked preference Fuzzy ranking Preference completion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：