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

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Stru...

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

Hybrid Local Causal Discovery

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ling, Zhaolong Peng, Honghui Zhang, Yiwen Zhou, Peng Wu, Xingyu Yu, Kui Wu, Xindong School of Computer Science and Technology Anhui University Anhui Hefei230601 China School of Hong Kong Polytechnic University Department of Computing 999077 Hong Kong Key Laboratory of Knowledge Engineering with Big Data the Ministry of Education of China China School of Computer Science and Information Technology Hefei University of Technology Hefei230009 China

Local causal discovery aims to learn and distinguish the direct causes and effects of a target variable from observed data. Existing constraint-based local causal discovery methods use AND or OR rules in constructing the local causal skeleton, but using either rule alone is prone to produce cascading errors in the learned local causal skeleton, and thus impacting the inference of local causal relationships. On the other hand, directly applying score-based global causal discovery methods to local causal discovery may randomly return incorrect results due to the existence of local equivalence classes. To address the above issues, we propose a Hybrid Local Causal Discovery algorithm, called HLCD. Specifically, HLCD initially utilizes a constraint-based approach combined with the OR rule to obtain a candidate skeleton and then employs a score-based method to eliminate redundant portions in the candidate skeleton. Furthermore, during the local causal orientation phase, HLCD distinguishes between V-structures and equivalence classes by comparing the local structure scores between the two, thereby avoiding orientation interference caused by local equivalence classes. We conducted extensive experiments with seven state-of-the-art competitors on 14 benchmark Bayesian network datasets, and the experimental results demonstrate that HLCD significantly outperforms existing local causal discovery algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

Generative AI for Deep Reinforcement Learning: Framework, Analysis, and Use Cases

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Geng Xie, Wenwen Niyato, Dusit Mei, Fang Kang, Jiawen Du, Hongyang Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn36830 United States

As a form of artificial intelligence (AI) technology based on interactive learning, deep reinforcement learning (DRL) has been widely applied across various fields and has achieved remarkable accomplishments. However, DRL faces certain limitations, including low sample efficiency and poor generalization. Therefore, we present how to leverage generative AI (GAI) to address these issues above and enhance the performance of DRL algorithms in this paper. We first introduce several classic GAI and DRL algorithms and demonstrate the applications of GAI-enhanced DRL algorithms. Then, we discuss how to use GAI to improve DRL algorithms from the data and policy perspectives. Subsequently, we introduce a framework that demonstrates an actual and novel integration of GAI with DRL, i.e., GAI-enhanced DRL. Additionally, we provide a case study of the framework on UAV-assisted integrated near-field/far-field communication to validate the performance of the proposed framework. Moreover, we present several future directions. Finally, the related code is available at: https://***/GAI-enhanced-DRL. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep reinforcement learning

Research on Object-oriented Exploration Algorithm 2020

学校读者我要写书评

暂无评论

Research on Object-oriented Exploration Algorithm

Proceedings of the 2020 International Conference on Cyberspace Innovation of Advanced Technologies

作者： Xiajiong Shen Peng Zhang Jiyong Yang Wan Chen Lei Zhang Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng PR China Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Institute of Data and Knowledge Engineering Henan University Kaifeng PR China

ISBN: (纸本)9781450387828

In formal concept analysis, attribute exploration is a very important methodology, which can explore the logical laws between attributes in a continuous and interactive way. Object-oriented exploration is very meaningful while it is similar to attribute exploration. It can explore the implication relationship between objects. But for the existing work, almost all are attribute exploration, object-oriented exploration is rare. Research on object-oriented exploration has great practical value, such as object classification, retrieval and excavation. In order to address this problem, this article takes the object as the main research point in formal concept analysis based on related knowledge of traditional attribute exploration, and proposes theories of object-oriented exploration. According to these related theories and the framework of attribute exploration algorithm, an object-oriented exploration algorithm is proposed in this paper. The algorithm can be used to explore and understand the relationship between objects, which facilitates to understand better the relationship between objects and attributes.

关键词： Formal concept analysis Object exploration Attribute exploration Implication Concept lattice

A Comprehensive Survey on Underwater Image Enhancement Based on Deep Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Cong, Xiaofeng Zhao, Yu Gui, Jie Hou, Junming Tao, Dacheng The School of Cyber Science and Engineering Southeast University Nanjing210000 China The School of Cyber Science and Engineering Southeast University Purple Mountain Laboratories Nanjing China Ministry of Education 210000 China The State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing210096 China The College of Computing & Data Science Nanyang Technological University #32 Block N4 #02a-014 50 Nanyang Avenue Singapore639798 Singapore

Underwater image enhancement (UIE) presents a significant challenge within computer vision research. Despite the development of numerous UIE algorithms, a thorough and systematic review is still absent. To foster future advancements, we provide a detailed overview of the UIE task from several perspectives. Firstly, we introduce the physical models, data construction processes, evaluation metrics, and loss functions. Secondly, we categorize and discuss recent algorithms based on their contributions, considering six aspects: network architecture, learning strategy, learning stage, auxiliary tasks, domain perspective, and disentanglement fusion. Thirdly, due to the varying experimental setups in the existing literature, a comprehensive and unbiased comparison is currently unavailable. To address this, we perform both quantitative and qualitative evaluations of state-of-the-art algorithms across multiple benchmark datasets. Lastly, we identify key areas for future research in UIE. A collection of resources for UIE can be found at https://***/YuZhao1999/UIE. Copyright © 2024, The Authors. All rights reserved.

关键词： Network architecture

A method for measuring journal discriminative capacity and its application in WOS 15th

学校读者我要写书评

暂无评论

A method for measuring journal discriminative capacity and i...

15th International Conference on Sustainable Digital Communities, iConference 2020

作者： Wang, Hao Zhang, Baolong Deng, Sanhong Su, Xinning School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China

ISBN: (纸本)9783030436865

Journal discriminative capacity refers to the degree of difference between the journals in research subjects, and is of great significance for detecting the level of journal differentiation. Current research on journal discrepancies is predominantly focused on the quantitative analysis of journal content, and rarely measures the degree of journal difference. To address this lapse in research, a method from the perspective of difference is proposed in this paper to quantitatively measure and analyze the discriminative capacity of journals. Using the bibliographic of Science Citation Index (SCI), Social Science Citation Index (SSCI), and Arts & Humanities Citation Index (A&HCI) journals from 2015–2017 as the data source, the contents differences of 23 Library and Information Science (LIS) journals are analyzed through hierarchical clustering and journal discriminative capacity (JDC) measurement. The discriminative capacity of disciplines is then calculated and combined with multidimensional scaling analysis to detect the difference characteristics of journals in ten disciplines, and the mean JDC is used to explore the overall differences of disciplines. Results show that the discriminative capacity of LIS journals is obviously stratified, the journals of library science are the most discriminating, and the journals of evaluation and review are the weakest. In addition, the journals of different disciplines have distinct disciplinary characteristics, with the discriminative capacity of SCI journals as the most notable, followed by SSCI journals, and with A&HCI journals displaying the weakest discriminative capacity. © Springer Nature Switzerland AG 2020.

关键词： Digital libraries

Salient Patch Based NAS for Grading of Colorectal Cancer Histology Images 13

学校读者我要写书评

暂无评论

Salient Patch Based NAS for Grading of Colorectal Cancer His...

13th International Multi-Conference on Complexity, Informatics and Cybernetics, IMCIC 2022

作者： Meng, Hang Li, Fei Yang, Zhen Zhu, Qiang Fan, Chaogang Zhan, Shu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Anhui Province Hefei230009 China The Second Affiliated Hospital of Anhui Medical University Anhui Province Hefei230601 China Tongcheng Teachers College Anhui Province Tongcheng231400 China Department of General Surgery The Affiliated BenQ Hospital of Nanjing Medical University Jiangsu Province Nanjing210021 China

ISBN: (纸本)9781950492619

Digital histopathological tissue images are gold material for cancer diagnosis and grades. Convolutional Neural Networks (CNNs) are state-of-the-art models in many image classification tasks. However, considering the limited computing resources, it is not practical to directly train CNNs on gigapixel resolution histopathological tissue images. Therefore, the entire histopathological image is commonly divided into a grid of patches and then fed each patch to CNNs, but not all patches are necessary for specific tasks. Besides, although CNNs are excellent image classifiers, many pre-trained models are based on natural images. Neural Architecture Search (NAS) can realize automatic search, construction, and training specific problemoriented networks. We present salient patch based NAS for grading colorectal cancer (CRC) histology images with these motivations. The proposed framework first applies the classic classification network to extract significant patches from the whole image, then use the network obtained by NAS to grade the patches, and finally aggregates the patch-level predictions to generate the entire CRC histological image label. Our experiments on microscopic colorectal tissue images demonstrate that the proposed method is sufficient to obtain more accurate classification results compared to its counterparts. We also conducted a comprehensive analysis of the different scenarios of the proposed method. © by the International Institute of Informatics and Systemics.

关键词： Grading

Author Name Disambiguation Based on Rule and Graph Model 1

学校读者我要写书评

暂无评论

9th CCF International Conference on Natural Language Processing and Chinese Computing, NLPCC 2020

作者： Zhang, Lizhi Ban, Zhijie Inner Mongilia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China

ISBN: (数字)9783030604509

ISBN: (纸本)9783030604493

Author name disambiguation has long been viewed as a challenging problem in scientific literature management, and with the substantial growth of the scientific literature, the solution to this problem has become increasingly difficult and urgency. In this paper, we conduct research on the author name disambiguation problem in large-scale academic papers. In our method, we combine the paper feature information and the relation information between the papers for disambiguation. Based on the Aminers disambiguation framework, we present a novel method to constructing the paper relation graph based on atomic cluster and propose an efficient post processing algorithm, aiming to improve the disambiguation performance by rule-based clustering, this algorithm utilizes similarity features based on metadata information and implement two types of disambiguation rules. We carefully evaluate the proposed disambiguation method on real-world large data and experimental result shows that our method achieves clearly better performance than the state-of-the-art methods. © 2020, Springer Nature Switzerland AG.

关键词： Clustering algorithms

USER: A unified information search and recommendation model based on integrated behavior sequence

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yao, Jing Dou, Zhicheng Xie, Ruobing Lu, Yanxiong Wang, Zhiping Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China WeChat Search Application Department Tencent China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Search and recommendation are the two most common approaches used by people to obtain information. They share the same goal - satisfying the user's information need at the right time. There are already a lot of Internet platforms and Apps providing both search and recommendation services, showing us the demand and opportunity to simultaneously handle both tasks. However, most platforms consider these two tasks independently - they tend to train separate search model and recommendation model, without exploiting the relatedness and dependency between them. In this paper, we argue that jointly modeling these two tasks will benefit both of them and finally improve overall user satisfaction. We investigate the interactions between these two tasks in the specific information content service domain. We propose first integrating the user's behaviors in search and recommendation into a heterogeneous behavior sequence, then utilizing a joint model for handling both tasks based on the unified sequence. More specifically, we design the Unified Information SEarch and Recommendation model (USER), which mines user interests from the integrated sequence and accomplish the two tasks in a unified way. Experiments on a dataset from a real-world information content service platform verify that our model outperforms separate search and recommendation baselines. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems