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

IEEE International Conference on big data

作者： Jiayin Yu Yulin He Joshua Zhexue Huang College of Computer Science & Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9781665445993

Due to the ubiquitous presence of missing values in real-world datasets, an imputation algorithm can recover the missing values and provide users with a complete dataset that utilizes all the available observed information. However, most of the imputation methods still have several limitations, including cannot restore the original distribution, handling various data missing patterns, and high missing rate dataset. In this poster, a novel neural network-based two-stage missing value imputation (abbreviated as TS-MVI) method is proposed to fill an incomplete condition attribute with the optimized attribute values for the supervised learning task. By initializing the missing values with random numbers, the imputation values are iteratively adjusted based on the new updating rule by minimizing both the autoencoder-oriented objective function and neural network-based classification error. The persuasive experiments show that TS-MVl method significantly outperforms current state-of-the-art imputation methods and thus demonstrate TS-MVI is a viable approach to deal with the missing value imputation problem.

关键词： Conferences Supervised learning Neural networks big data Linear programming Task analysis

来源：评论

学校读者我要写书评

暂无评论

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 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.

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

来源：评论

学校读者我要写书评

暂无评论

3D CT Liver Images Lesion Extraction and Classification for Using 3D-CNN with GLRLM

3D CT Liver Images Lesion Extraction and Classification for ...

引用

Advanced Computing Technologies (ICoACT), International Conference on

作者： S. Jayarathna R. Sowmiya G. Nallasivan G. Sahaana S. Ashok R. Saravanakumar Master of Computer Applications Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Computer Applications Karpagam Academy of Higher Education Coimbatore Tamil Nadu India Department of Computer Science and Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai Tamil Nadu India Department of Artificial Intelligence & Data Science Dhanalakshmi College of Engineering Chennai Tamil Nadu India Department of Electronics and Communication Engineering Vel Tech Multi Tech Dr. Rangarajan Dr. Sakunthala Engineering College Chennai Tamil Nadu India Iconix Software Solution Tirunelveli Tamil Nadu India

ISBN: (数字)9798331509859

ISBN: (纸本)9798331509866

The imaging technique known as computed tomography (CT) is often considered to be the most reliable way for non-invasive diagnosis. Through the use of three-dimensional (3D) computed tomography images, we were able to categorize aggressive tumors that were found in the liver for the aim of this research. When it comes to the three-dimensional (3D) CT image, the dimension reduction is accomplished by the use of principal component analysis (PCA). The Random Forest Algorithm is responsible for identifying the abnormal hepatic region, and a median filter is used to reduce the amount of noise occurring. Methods of data augmentation are also employed in this process. To extract Gray Level Run Length Matrix (GLRLM) features, using Pyradiomics python package. These features are then fed into a 3D-CNN classifier to classify malignant tumors and haemangiomas. Our model was found to have greater performance after being compared to the findings of other models. This was revealed after the comparison was made. For the training dataset, our model has an accuracy of 97.2%, and for the test dataset, it has an accuracy of 98.25%. This accuracy is determined by the performance metrics that our model incorporates.

关键词： Training Solid modeling Accuracy Three-dimensional displays Computed tomography Liver Feature extraction data augmentation data models Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Random Sample Partition-Based Clustering Ensemble Algorithm for big data

Random Sample Partition-Based Clustering Ensemble Algorithm ...

引用

IEEE International Conference on big data

作者： Xueqin Du Yulin He Joshua Zhexue Huang College of Computer Science & Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (纸本)9781665445993

A novel random sample partition-based clustering ensemble (RSP-CE) algorithm is proposed in this paper to handle the big data clustering problems. There are three key components in RSP-CE algorithm, i.e., generating the base clustering results on RSP data blocks, harmonizing the based clustering results with maximum mean discrepancy (MMD) criterion, and refining the RSP clustering results. RSP data blocks have the consistent sample distributions with the whole big data and thus provide the possibility for using base clustering results on different data subsets to approximate the clustering result on whole big data. The experimental results in comparison with other 5 well-known clustering ensemble algorithms on 4 big data sets show that RSP-CE algorithm obtains the better normalized mutual information (NMI) values and Fowlkes-Mallows Index (FMI) values with the less training time consumptions and thus demonstrate that RSP-CE algorithm is a viable approach to deal with the big data clustering problems.

关键词： Training Conferences Refining Clustering algorithms big data Approximation algorithms Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Accurate Leukocyte Detection Based on Deformable-DETR and Multi-Level Feature Fusion for Aiding Diagnosis of Blood Diseases

arXiv

引用

arXiv 2024年

作者： Chen, Yifei Zhang, Chenyan Chen, Ben Huang, Yiyu Sun, Yifei Wang, Changmiao Fu, Xianjun Dai, Yuxing Qin, Feiwei Peng, Yong Gao, Yu HDU-ITMO Joint Institute Hangzhou Dianzi University Hangzhou310018 China Medical Big Data Lab Shenzhen Research Institute of Big Data Shenzhen518172 China School of Artificial Intelligence Zhejiang College of Security Technology Wenzhou325016 China National-local Joint Engineering Research Center for Digitalized Electrical Design Technology Wenzhou University Wenzhou325035 China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China Department of Hematology Zhejiang Hospital Hangzhou310018 China

In standard hospital blood tests, the traditional process requires doctors to manually isolate leukocytes from microscopic images of patients’ blood using microscopes. These isolated leukocytes are then categorized via automatic leukocyte classifiers to determine the proportion and volume of different types of leukocytes present in the blood samples, aiding disease diagnosis. This methodology is not only time-consuming and labor-intensive, but it also has a high propensity for errors due to factors such as image quality and environmental conditions, which could potentially lead to incorrect subsequent classifications and misdiagnosis. Contemporary leukocyte detection methods exhibit limitations in dealing with images with fewer leukocyte features and the disparity in scale among different leukocytes, leading to unsatisfactory results in most instances. To address these issues, this paper proposes an innovative method of leukocyte detection: the Multi-level Feature Fusion and Deformable Self-attention DETR (MFDS-DETR). To tackle the issue of leukocyte scale disparity, we designed the High-level Screening-feature Fusion Pyramid (HS-FPN), enabling multi-level fusion. This model uses high-level features as weights to filter low-level feature information via a channel attention module and then merges the screened information with the high-level features, thus enhancing the model’s feature expression capability. Further, we address the issue of leukocyte feature scarcity by incorporating a multi-scale deformable self-attention module in the encoder and using the self-attention and cross-deformable attention mechanisms in the decoder, which aids in the extraction of the global features of the leukocyte feature maps. The effectiveness, superiority, and generalizability of the proposed MFDS-DETR method are confirmed through comparisons with other cutting-edge leukocyte detection models using the private WBCDD, public LISC and BCCD datasets. Our source code and private WBCCD

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Full-Space Wireless Sensing Enabled by Multi-Sector Intelligent Surfaces

引用

IEEE Transactions on Wireless Communications 2025年

作者： Zhang, Yumeng Shao, Xiaodan Li, Hongyu Clerckx, Bruno Zhang, Rui Hong Kong University of Science and Technology Electronic and Computing Engineering Hong Kong Hong Kong University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada Internet of Things Thrust Guangdong Guangzhou511400 China Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom Kyung Hee University Seoul Korea Republic of The Chinese University of HongKong School of Science and Engineering Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China National University of Singapore Department of Electrical and Computer Engineering Singapore117583 Singapore

The multi-sector intelligent surface (IS), benefiting from a smarter wave manipulation capability, has been shown to enhance channel gain and offer full-space coverage in communications. However, the benefits of multi-sector IS in wireless sensing remain unexplored. This paper introduces the application ofmulti-sector IS for wireless sensing/localization. Specifically, we propose a new self-sensing system, where an active source controller uses the multi-sector IS geometry to reflect/scatter the emitted signals towards the entire space, thereby achieving full-space coverage for wireless sensing. Additionally, dedicated sensors are installed aligned with the IS elements at each sector, which collect echo signals fromthe target and cooperate to sense the target angle. In this context, we develop a maximum likelihood estimator of the target angle for the proposed multi-sector IS self-sensing system, along with the corresponding theoretical limits defined by the Craḿer-Rao Bound. The analysis reveals that the advantages of the multi-sector IS self-sensing system stem from two aspects: enhancing the probing power on targets (thereby improving power efficiency) and increasing the rate of target angle (thereby enhancing the transceiver's sensitivity to target angles). Finally, our analysis and simulations confirm that the multi-sector IS self-sensing system, particularly the 4-sector architecture, achieves full-space sensing capability beyond the single-sector IS configuration. Furthermore, similarly to communications, employing directive antenna patterns on each sector's IS elements and sensors significantly enhances sensing capabilities. This enhancement originates from both aspects of improved power efficiency and target angle sensitivity, with the former also being observed in communications while the latter being unique in sensing. © 2002-2012 IEEE.

关键词： Directive antennas

来源：评论

学校读者我要写书评

暂无评论

A Node-collaboration-informed Graph Convolutional Network for Precise Representation to Undirected Weighted Graphs

arXiv

引用

arXiv 2022年

作者： Wang, Ying Yuan, Ye Luo, Xin The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

An undirected weighted graph (UWG) is frequently adopted to describe the interactions among a solo set of nodes from real applications, such as the user contact frequency from a social network services system. A graph convolutional network (GCN) is widely adopted to perform representation learning to a UWG for subsequent pattern analysis tasks such as clustering or missing data estimation. However, existing GCNs mostly neglects the latent collaborative information hidden in its connected node pairs. To address this issue, this study proposes to model the node collaborations via a symmetric latent factor analysis model, and then regards it as a node-collaboration module for supplementing the collaboration loss in a GCN. Based on this idea, a Node-collaboration-informed Graph Convolutional Network (NGCN) is proposed with three-fold ideas: a) Learning latent collaborative information from the interaction of node pairs via a node-collaboration module;b) Building the residual connection and weighted representation propagation to obtain high representation capacity;and c) Implementing the model optimization in an end-to-end fashion to achieve precise representation to the target UWG. Empirical studies on UWGs emerging from real applications demonstrate that owing to its efficient incorporation of node-collaborations, the proposed NGCN significantly outperforms state-of-the-art GCNs in addressing the task of missing weight estimation. Meanwhile, its good scalability ensures its compatibility with more advanced GCN extensions, which will be further investigated in our future studies. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Towards Seamless Connectivity: Implementing 6G Communication Technologies In Next-Generation Networks

Towards Seamless Connectivity: Implementing 6G Communication...

引用

Advancement in Technology (ICONAT), International Conference for

作者： K. Kalaiselvi R. Sankar S Supriya G Kaushik Hemanth Swamy M Devika Department of Data Analytics Saveetha College of Liberal Arts and Sciences SIMATS Chennai Tamilnadu India Department of Electrical and Electronics Engineering Chennai Institute of Technology Chennai Tamil Nadu India Department of Computer Science and Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai Tamil Nadu India Department of Electronics and Communication Engineering MLR Institute of Technology Hyderabad India Senior Software Engineer Motorola Solutions Department of AI& DS Dhanalakshmi College of Engineering Chennai Tamil Nadu India

ISBN: (数字)9798350354171

ISBN: (纸本)9798350354188

Advanced wireless networks are essential given the increase in demand for smart services enabled by the Internet of Everything (IoE). Despite the fact that 5G networks could enable Internet of Everything (IoE)-based services, they can’t meet all of the requirements needed to create intelligent applications. In order to overcome the shortcomings of the current infrastructure, there is an increasing demand to investigate the potential of 6G wireless communication technologies. Complex network optimization problems can be resolved by integrating artificial intelligence into sixth generation networks. An increasing user base and support for large-scale data-driven applications are essential given the fast evolving 6G landscape. In addition to highlighting network needs, critical supporting technologies, and a comparison of 5G and 6G networks, this study looks at recent advancements and trends in 6G technology. The report also explores new approaches to 6G connectivity, such as edge computing, backscatter communications, AI-driven IoT networks, and holographic beamforming, all of which are meant to support intelligent communities. In order to achieve the goal of 6Gbased IoT networks, it concludes by outlining potential research avenues.

关键词： 6G mobile communication 5G mobile communication Wireless networks Complex networks Market research Communications technology Internet of Things Optimization Next generation networking Edge computing

来源：评论

学校读者我要写书评

暂无评论

Automatic Text Summarization Method Based on Improved Textrank Algorithm and K-Means Clustering

SSRN

引用

SSRN 2023年

作者： Liu, Wenjun Sun, Yuyan Yu, Bao Wang, Hailan Peng, Qingcheng Hou, Mengshu Guo, Huan Wang, Hai Liu, Cheng Chengdu611731 China School of Computer and Software Engineering XiHua University Chengdu610039 China School of Big Data and Artificial Intelligence Chengdu Technological University Chengdu611730 China Science and Technology on Communication Security Laboratory The 30th Research Institute of China Electronics Technology Group Corporation Chengdu610041 China

Automatic text summarization is to obtain a summary by compressing the text while retaining its important information, and then users can obtain the important content of the text by reading the summary. In the research literatures, the extraction method is widely used and is also one of the main research methods of most abstracts. However, this summary method still has some problems. The selection of the initial cluster center has not been carefully determined, and in articles with complex sentences, the sentence redundancy summarized is high. In order to solve the above problems, this paper proposes an automatic text summarization method based on improved TextRank algorithm and K-Means clustering. This method uses the improved BM25 model to calculate the BM25 similarity between sentences, and then uses the TextRank model to obtain the TR score of sentences. Then, the TR score is used to select the initial center of K-Means clustering. Finally, the summary is obtained through the class score and sentence score. The experimental results show that the proposed BM25Rank algorithm has a better effect on DUC2004 dataset. In conclusion, the improved TextRank and K-Means method proposed in this paper improve the accuracy of automatic text summarization and reduce the redundancy. © 2023, The Authors. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Research Artifacts in software engineering Publications: Status and Trends

arXiv

引用

arXiv 2024年

作者： Liu, Mugeng Huang, Xiaolong He, Wei Xie, Yibing Zhang, Jie M. Jing, Xiang Chen, Zhenpeng Ma, Yun Ministry of Education School of Computer Science Peking University Beijing China School of Software and Microelectronics Peking University Beijing China Department of Informatics King’s College London London United Kingdom National Key Laboratory of Data Space Technology and System Beijing China School of Computer Science and Engineering Nanyang Technological University Singapore Singapore Institute for Artificial Intelligence Peking University Beijing China

The software engineering (SE) community has been embracing the open science policy and encouraging researchers to disclose artifacts in their publications. However, the status and trends of artifact practice and quality remain unclear, lacking insights on further improvement. In this paper, we present an empirical study to characterize the research artifacts in SE publications. Specifically, we manually collect 1,487 artifacts from all 2,196 papers published in top-tier SE conferences (ASE, FSE, ICSE, and ISSTA) from 2017 to 2022. We investigate the common practices (e.g., URL location and format, storage websites), maintenance activities (e.g., last update time and URL validity), popularity (e.g., the number of stars on GitHub and characteristics), and quality (e.g., documentation and code smell) of these artifacts. Based on our analysis, we reveal a rise in publications providing artifacts. The usage of Zenodo for sharing artifacts has significantly increased. However, artifacts stored in GitHub tend to receive few stars, indicating a limited influence on real-world SE applications. We summarize the results and provide suggestions to different stakeholders in conjunction with current guidelines. © 2024, CC BY.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：