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

data science and Its Applications (ICoDSA), International Conference on

作者： Sekar Alisha Firdaus Laksmi Dwi Nurmuthia Raina Imtiyaz Alexander Agung Santoso Gunawan Karli Eka Setiawan Data Science Program Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9798350365351

ISBN: (纸本)9798350365368

In the rapidly evolving beauty industry, consumers are often bombarded with an overwhelming array of skincare brands and products, making the quest for the perfect skincare regimen a daunting task. This saturation of the market not only confuses consumers but also poses the risk of resource wastage and potential skin damage due to incompatible ingredient combinations. To mitigate these challenges, our research presents an innovative recommendation system designed to streamline the product selection process. Utilizing the principle of cosine similarity, our methodology involves a detailed analysis of the ingredients contained in various skincare products. A quantitative foundation for evaluating ingredient lists of various skincare products is provided by cosine similarity, a mathematical metric that evaluates the similarity between two non-zero vectors by computing the cosine of the angle between them. Our algorithm generates customized product recommendations by thoroughly comprehending the intricate interactions among different constituents. This bespoke approach simplifies the decision-making process for consumers, enabling them to make well-informed choices that cater to their unique skin health needs. The effectiveness of our recommendation system is validated through comprehensive user feedback, demonstrating its potential to redefine the paradigm of personalized skincare recommendations within the beauty industry. Through providing customers with critical information and encouraging a culture of knowledgeable choice, we see a time when customized skincare products will not only increase customer satisfaction but also brand loyalty, which will be a big step toward the democratization of customized skincare.

关键词： Industries Measurement Deep learning Diversity methods Skin Vectors Software

来源：评论

学校读者我要写书评

暂无评论

Bit-mask Robust Contrastive Knowledge Distillation for Unsupervised Semantic Hashing 24

Bit-mask Robust Contrastive Knowledge Distillation for Unsup...

引用

33rd ACM Web Conference, WWW 2024

作者： He, Liyang Huang, Zhenya Liu, Jiayu Chen, Enhong Wang, Fei Sha, Jing Wang, Shijin School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China School of Data Science University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China State Key Laboratory of Cognitive Intelligence Hefei China

ISBN: (纸本)9798400701719

Unsupervised semantic hashing has emerged as an indispensable technique for fast image search, which aims to convert images into binary hash codes without relying on labels. Recent advancements in the field demonstrate that employing large-scale backbones (e.g., ViT) in unsupervised semantic hashing models can yield substantial improvements. However, the inference delay has become increasingly difficult to overlook. Knowledge distillation provides a means for practical model compression to alleviate this delay. Nevertheless, the prevailing knowledge distillation approaches are not explicitly designed for semantic hashing. They ignore the unique search paradigm of semantic hashing, the inherent necessities of the distillation process, and the property of hash codes. In this paper, we propose an innovative Bit-mask Robust Contrastive knowledge Distillation (BRCD) method, specifically devised for the distillation of semantic hashing models. To ensure the effectiveness of two kinds of search paradigms in the context of semantic hashing, BRCD first aligns the semantic spaces between the teacher and student models through a contrastive knowledge distillation objective. Additionally, to eliminate noisy augmentations and ensure robust optimization, a cluster-based method within the knowledge distillation process is introduced. Furthermore, through a bit-level analysis, we uncover the presence of redundancy bits resulting from the bit independence property. To mitigate these effects, we introduce a bit mask mechanism in our knowledge distillation objective. Finally, extensive experiments not only showcase the noteworthy performance of our BRCD method in comparison to other knowledge distillation methods but also substantiate the generality of our methods across diverse semantic hashing models and backbones. The code for BRCD is available at https://***/hly1998/BRCD. © 2024 Owner/Author.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Automated Adversarial-Attack Removal with SafetyNet Using ADGIT

Automated Adversarial-Attack Removal with SafetyNet Using AD...

引用

International Conference on Smart Computing & Communications (ICSCC)

作者： Steven Halim Arvio Anandi Vyos Devin Alexander Agung Santoso Gunawan Karli Eka Setiawan Data Science Program Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9798350363104

ISBN: (纸本)9798350363111

In the realm of artificial intelligence (AI), a notable challenge has surfaced: adversarial attacks, these attacks involve altering input data to mislead AI models. Developing defensive measures against adversarial attacks is necessary for a more reliable AI system to protect its users from potential harm. In response to the risk of adversarial attacks, this study aims to mitigate the risk of such attacks, especially in image classification tasks, by proposing Adversarial Detection Guided Input Transformation (ADGIT) as an architecture designed to handle such attacks. In this study, the author will experiment with creating such architecture and measure the quality of the proposed technique. ADGIT works by utilizing SafetyNet as an adversarial detector to detect and cleanse adversarial attacks. The author concludes that the proposed technique could improve robustness against adversarial attacks increasing consistent prediction accuracy from 43% to 60% and reconstructing adversarial input images to be more similar to their unperturbed version, with reconstructed images' PSNR score on 0.007 perturbation increased from 43.1182 to 89.0999. The technique proposed could be used as a new defensive measure and improving robustness against adversarial attacks. Although ADGIT is capable of handling adversarial samples, ADGIT has a drawback in performance speed due to the extra preprocessing step.

关键词： Accuracy Perturbation methods Detectors computer architecture Robustness data models Security Artificial intelligence Image reconstruction Image classification

来源：评论

学校读者我要写书评

暂无评论

A Simulated Annealing BP Algorithm for Adaptive Temperature Setting 14th

A Simulated Annealing BP Algorithm for Adaptive Temperature ...

引用

14th International Symposium on Intelligence Computation and Applications, ISICA 2023

作者： Teng, Zi Liang, Zhixun Li, Yuanxiang Yi, Yunfei School of Mathematics and Statistics Central South University Hunan Changsha410083 China School of Big Data and Computer Hechi University Guangxi Yizhou546300 China School of Computer Science Wuhan University Hubei Wuhan430072 China

ISBN: (纸本)9789819743957

The backpropagation (BP) algorithm is so far, the most effective algorithm for neural network learning and training. This algorithm is based on the fast gradient descent method in optimization theory, which is essentially a deterministic local optimization algorithm. In this paper, for improving its local optimization, enhancing its global optimization potential ability is discussed by combining with the simulated annealing mechanism. The BP algorithm is utilized as the core component under the framework of simulated annealing algorithm, and the Metropolis criterion is used as the heuristic strategy. Integrating advantages of the BP algorithm and the simulated annealing algorithm, An adaptive simulated annealing based BP algorithm is designed. In this algorithm there two adaptive strategies, one is the setting of annealing temperature, and the other is the random perturbation of connection weight and bias value. The adaptive temperature setting can simultaneously reflect changes of the loss function value, and the adaptive perturbation is related to the network complexity and loss function value. By using the small batch gradient descent method used in machine learning commonly, the update of the annealing temperature is synchronized with the input sample batch, which follows up the search state of the algorithm running. The perturbed renewal of those parameters of the neural network is based on the current network configuration to avoid blind random perturbation. The algorithm is tested with the Fashion-MNIST and CIFAR-10 datasets, which are widely used in the current deep learning research field. The classification and recognition accuracies of the algorithm exceed 99% both. These results are better than the best results reported currently for the two datasets. In addition, the adaptive BP algorithm is repeated 30 times with these two datasets respectively. The statistical analysis results show the robustness and stability of the algorithm. © The Author(s), under

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Predicting Cervical Cancer Using Deep Learning Mutation-based Atom Search Optimization (MASO) Algorithm 2

Predicting Cervical Cancer Using Deep Learning Mutation-base...

引用

2nd IEEE International Conference on Trends in Quantum Computing and Emerging Business Technologies, TQCEBT 2024

作者： Mayuri, A.V.R. Selvekumar Subash, K. Aeron, Anurag Vit Bhopal University School of Computing Science and Engineering Madhya Pradesh Sehore India Bahir Dar University Bahir Dar Institute of Technology Department of Electrical and Computer Engineering Ethiopia Department of Data Science Trichy India Miet Meerut Department of Computer Science and Engineering Uttar Pradesh India

ISBN: (纸本)9798350384277

Worldwide, women are compressed by cervical cancer, which is a prevalent malignancy. This disease, which is currently the fourth leading cause of death for women, shows no symptoms when it first arises. Cells that cause cervical cancer multiply gradually at the cervix. If this cancer is detected early enough, treatment can be effective. Presently, it is difficult for medical workers to detect this kind of cancer before it spreads rapidly. This study used a number of machine learning classification algorithms with risk markers to predict cervical cancer. These study suggestions mutation-based Atom Search Optimization (MASO) with a Deep Convolutional Neural Network (DCNN) to offer a original method for automated diagnosis of uterine cervical cancer. Though DCNN is used to extract features from medical imaging data, MASO is used to increase the optimization of the diagnostic model. Composed, these technologies have the potential to rise cervical cancer diagnosis accuracy and efficiency, offering an automated approach for early detection and prompt intervention. Our proposed model established a strong 95% accuracy rate for generalization. This study explores the difficulties caused by missing values and class imbalance in the specific dataset with the goal of assisting medical professionals in the early detection of cervical cancer and improving treatment for people that are impacted by the illness. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

The implicit bias of adam on separable data 24

The implicit bias of adam on separable data

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Chenyang Zhang Difan Zou Yuan Cao Department of Statistics and Actuarial Science School of Computing and Data Science The University of Hong Kong Department of Computer Science School of Computing and Data Science & Institute of Data Science The University of Hong Kong Department of Statistics and Actuarial Science School of Computing and Data Science & Department of Mathematics The University of Hong Kong

ISBN: (纸本)9798331314385

Adam has become one of the most favored optimizers in deep learning problems. Despite its success in practice, numerous mysteries persist regarding its theoretical understanding. In this paper, we study the implicit bias of Adam in linear logistic regression. Specifically, we show that when the training data are linearly separable, the iterates of Adam converge towards a linear classifier that achieves the maximum ℓ∞ -margin in direction. Notably, for a general class of diminishing learning rates, this convergence occurs within polynomial time. Our result shed light on the difference between Adam and (stochastic) gradient descent from a theoretical perspective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temporal Feature Mining in Dynamic Graph of Brain Connectivity data

Temporal Feature Mining in Dynamic Graph of Brain Connectivi...

引用

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

作者： Liu, Tao Jing, Ming Zhang, Guangwei Zhang, Li Yu, Jiguo School of Computer Science and Technology Qilu University of Technology Jinan China Big Data Institute Qilu University of Technology Jinan China Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9798350337020

In recent years, the graph feature mining method of brain connection data based on graph theory has been regarded as a popular and universal technology in the field of neuroscience. How to mine valuable information from brain connection data has become a research hotspot. Current research shows that the pathogenic factors of attention deficit and hyperactivity disorder (ADHD) may be caused by the abnormal connection between brain network structures. In order to find out the pathogenic factors of ADHD patients, we also carried out frequent sub-graph mining on the connectivity graph data of brain functional network. By constantly adjusting the sup-port threshold, all the subgraphs of ADHD patients and healthy control group were mined, and the differences in brain region connectivity were successfully found out. By combining the recently introduced neural document embedding model with traditional pattern mining techniques, we regard the brain network connection structure graph as the document and frequent subgraph as the atomic unit of the embedding process. By learning the mapping, each graph can be mapped to a D-dimensional continuous vector. The mapping needs to capture the similarity between the graphs. Feature vectors can be used as the direct input of graph classification in many traditional machine learning methods. Finally, support vector machine in machine learning is used to verify the accuracy of classification, and the results show that the accuracy is high. © 2023 IEEE.

关键词： ADHD brain network identification fMRI Frequent subgraph mining Graph data mining

来源：评论

学校读者我要写书评

暂无评论

Advancements in Liver Tumor Detection:A Comprehensive Review of Various Deep Learning Models

引用

computer Modeling in Engineering & sciences 2025年第1期142卷 91-122页

作者： Shanmugasundaram Hariharan D.Anandan Murugaperumal Krishnamoorthy Vinay Kukreja Nitin Goyal Shih-Yu Chen Deptartment of Artificial Intelligence and Data Science Vardhaman College of EngineeringHyderabad501218India Deptartment of CSE V.S.B College of EngineeringKarur639111India Deptartment of Electrical and Electronics Engineering Vardhaman College of EngineeringHyderabad501218India Centre for Research Impact&Outcome Chitkara UniversityRajpura140401PunjabIndia Department of Computer Science and Engineering School of Engineering and TechnologyCentral University of HaryanaMahendergarh123031HaryanaIndia Department of Computer Science and Information Engineering National Yunlin University of Science and TechnologyYunlin64002Taiwan Intelligence Recognition Industry Service Research Center National Yunlin University of Science and TechnologyYunlin64002Taiwan

Liver cancer remains a leading cause of mortality worldwide,and precise diagnostic tools are essential for effective treatment *** Tumors(LTs)vary significantly in size,shape,and location,and can present with tissues of similar intensities,making automatically segmenting and classifying LTs from abdominal tomography images crucial and *** review examines recent advancements in Liver Segmentation(LS)and Tumor Segmentation(TS)algorithms,highlighting their strengths and limitations regarding precision,automation,and *** metrics are utilized to assess key detection algorithms and analytical methods,emphasizing their effectiveness and relevance in clinical *** review also addresses ongoing challenges in liver tumor segmentation and identification,such as managing high variability in patient data and ensuring robustness across different imaging *** suggests directions for future research,with insights into technological advancements that can enhance surgical planning and diagnostic accuracy by comparing popular *** paper contributes to a comprehensive understanding of current liver tumor detection techniques,provides a roadmap for future innovations,and improves diagnostic and therapeutic outcomes for liver cancer by integrating recent progress with remaining challenges.

关键词： Liver tumor detection liver tumor segmentation image processing liver tumor diagnosis feature extraction tumor classification deep learning machine learning

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Streaming Feature Selection Based on FDAF-score 12

Hierarchical Streaming Feature Selection Based on FDAF-score

引用

12th International Conference on Information Technology in Medicine and Education, ITME 2022

作者： He, Zhuoxin Mao, Yu Zeng, Yixiang Yu, Xiehua Lin, Yaojin Lab of Data Science and Intelligence Application Minnan Normal University School of Computer Science Zhangzhou China Minnan Science and Technology University School of Computer and Information Quanzhou China

ISBN: (纸本)9798350310153

In many practical classification scenarios, the data label space has a hierarchical structure, these data often have high-dimensional features, and there are irrelevant and redundant features. Thus, a variety of hierarchical classification feature selection methods are proposed. However, most of the existing algorithms ignore the temporal uncertainty and unknown of the feature space, and can only deal with static feature space data. Therefore, a new hierarchical streaming feature selection method is proposed. First, the algorithm uses the sibling strategy and the exclusion strategy in the hierarchical relationship to consider the relationship between homogeneous and heterogeneous samples. Then, the FDAF-score algorithm is integrated into the hierarchical classification streaming feature selection and used as a criterion for evaluating feature importance. Second, the improved Gaussian kernel function is used to judge the degree of redundancy between features, and the redundant features are removed. Finally, experiments on six hierarchical classification data sets show the effectiveness of the proposed algorithm. © 2022 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Piccolo: Large-Scale Graph Processing with Fine-Grained in-Memory Scatter-Gather 31

Piccolo: Large-Scale Graph Processing with Fine-Grained in-M...

引用

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

作者： Shin, Changmin Song, Jaeyong Jang, Hongsun Kim, Dogeun Sung, Jun Kwon, Taehee Ju, Jae Hyung Liu, Frank Choi, Yeonkyu Lee, Jinho Seoul National University Department of Electrical and Computer Engineering Korea Republic of Old Dominion Univeristy School of Data Science United States Samsung Electronics Korea Republic of

ISBN: (纸本)9798331506476

Graph processing requires irregular, fine-grained random access patterns incompatible with contemporary off-chip memory architecture, leading to inefficient data access. This inefficiency makes graph processing an extremely memory-bound application. Because of this, existing graph processing accelerators typically employ a graph tiling-based or processing-in-memory (PIM) approach to relieve the memory bottleneck. In the tiling-based approach, a graph is split into chunks that fit within the on-chip cache to maximize data reuse. In the PIM approach, arithmetic units are placed within memory to perform operations such as reduction or atomic addition. However, both approaches have several limitations, especially when implemented on current memory standards (i.e., DDR). Because the access granularity provided by DDR is much larger than that of the graph vertex property data, much of the bandwidth and cache capacity are wasted. PIM is meant to alleviate such issues, but it is difficult to use in conjunction with the tiling-based approach, resulting in a significant disadvantage. Furthermore, placing arithmetic units inside a memory chip is expensive, thereby supporting multiple types of operation is thought to be impractical. To address the above limitations, we present Piccolo, an end-to-end efficient graph processing accelerator with fine-grained in-memory random scatter-gather. Instead of placing expensive arithmetic units in off-chip memory, Piccolo focuses on reducing the off-chip traffic with non-arithmetic function-in-memory of random scatter-gather. To fully benefit from in-memory scatter-gather, Piccolo redesigns the cache and miss-handling architecture (MHA) of the accelerator such that it can enjoy both the advantage of tiling and in-memory operations. Piccolo achieves a maximum speedup of 3.28 × and a geometric mean speedup of 1.62 ×, along with up to 59.7% reduction in energy consumption across various and extensive benchmarks. © 2025 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：