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

arXiv 2021年

作者： Wang, Shuai Zhang, Kun Wu, Le Ma, Haiping Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China Institute of Artificial Intelligence Hefei Comprehensive National Science Center China Anhui University China

The cold start problem in recommender systems is a long-standing challenge, which requires recommending to new users (items) based on attributes without any historical interaction records. In these recommendation systems, warm users (items) have privileged collaborative signals of interaction records compared to cold start users (items), and these Collaborative Filtering (CF) signals are shown to have competing performance for recommendation. Many researchers proposed to learn the correlation between collaborative signal embedding space and the attribute embedding space to improve the cold start recommendation, in which user and item categorical attributes are available in many online platforms. However, the cold start recommendation is still limited by two embedding spaces modeling and simple assumptions of space transformation. As user-item interaction behaviors and user (item) attributes naturally form a heterogeneous graph structure, in this paper, we propose a privileged graph distillation model (PGD). The teacher model is composed of a heterogeneous graph structure for warm users and items with privileged CF links. The student model is composed of an entity-attribute graph without CF links. Specifically, the teacher model can learn better embeddings of each entity by injecting complex higher-order relationships from the constructed heterogeneous graph. The student model can learn the distilled output with privileged CF embeddings from the teacher embeddings. Our proposed model is generally applicable to different cold start scenarios with new user, new item, or new user-new item. Finally, extensive experimental results on the real-world datasets clearly show the effectiveness of our proposed model on different types of cold start problems, with average 6.6%, 5.6%, and 17.1% improvement over state-of-the-art baselines on three datasets, respectively. © 2021, CC BY.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Complete 3D model reconstruction using a depth sensor

Complete 3D model reconstruction using a depth sensor

引用

International Conference on Intelligent Computing and Integrated Systems (ICISS)

作者： Guangyu Mu Miao Liao Ruigang Yang Dantong Ouyang Zhiwen Xu Xiaoxin Guo Department of Computer Science and Technology Jilin University Changchun China Department of Engineering Center of Visualization and Virtual Environment University of Kentucky Lexington USA Department of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE Jilin University Changchun China

We propose a fast and simple application system of 3D model reconstruction. We acquire range images by using a combination of a regular camera and a depth sensor. The reconstruction of a 3D model consists of four key steps: (i) Initial alignment either feature tracking or the 4-points congruent sets algorithm is used to align surfaces captured at different frames. (ii)The iterative closest point (ICP) method is applied to further align the piecewise surfaces from the last step. (iii) The surfaces are merged into a whole 3D model by the volumetric method. (iv) In the refinement step, we fill holes and produce a complete 3D model that approximates the original model with robust repair of polygonal models. At last, we present the experimental results which show that the errors between our reconstructed model and the ground truth are less than 1%.

关键词： Biomedical imaging Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Survey on ontology learning research

引用

Ruan Jian Xue Bao/Journal of Software 2006年第9期17卷 1837-1847页

作者： Du, Xiao-Yong Li, Man Wang, Shan School of Information Renmin University of China Beijing 100872 China Key Laboratory of Data Engineering and Knowledge Engineering Beijing 100872 China

Recently, ontology learning is emerging as a new hotspot of research in computer science. In this paper the issue of ontology learning is divided into nine sub-issues according to the structured degree (structured, semi-structured, non-structured) of source data and learning objects (concept, relation, axiom) of ontology. The characteristics, major approaches and the latest research progress of the nine sub-issues are summarized. Based on the analysis framework proposed in the paper, existing ontology learning tools are introduced and compared. The problems of current research are discussed, and finally the future directions are pointed out.

关键词： Computer science

来源：评论

学校读者我要写书评

暂无评论

Chinese integral word segmentation recognition based on reliability

引用

Journal of Information and Computational Science 2009年第1期6卷 533-542页

作者： Wan, Changxuan Wang, Fang School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 China School of Humanities Nanchang University Nanchang 330013 China

As one part of preprocessing, automatic word segmentation is an key issue in Chinese information retrieval. Since integral words are put wholly together to compose into the more meaningful words and more express users' query minds in information retrieval, we combine the calculation of mutual information, prefix- and-suffix information of integral word with the reliability of composing into the integral word, and put forward three Chinese integral word segmentation recognition method based on reliability according to the characteristics of the integral words. Then, we design and realize the prototype system of three Chinese integral word segmentation recognition methods based on reliability. Finally, tests and analysis on 2nd SIGHAN (2005) PKU test corpus show that the recognition performance of the system is good, and can satisfy different needs at the same time. © 2009 Binary Information Press.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Unifying Large Language Models and knowledge Graphs: A Roadmap

arXiv

引用

arXiv 2023年

作者： Pan, Shirui Luo, Linhao Wang, Yufei Chen, Chen Wang, Jiapu Wu, Xindong Griffith University QLD Australia The Department of Data Science and AI Monash University Melbourne Australia The Nanyang Technological University Singapore The Faculty of Information Technology Beijing University of Technology Beijing China The Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei China The Research Center for Knowledge Engineering Zhejiang Lab Hangzhou China

Large language models (LLMs), such as ChatGPT and GPT4, are making new waves in the field of natural language processing and artificial intelligence, due to their emergent ability and generalizability. However, LLMs are black-box models, which often fall short of capturing and accessing factual knowledge. In contrast, knowledge Graphs (KGs), Wikipedia and Huapu for example, are structured knowledge models that explicitly store rich factual knowledge. KGs can enhance LLMs by providing external knowledge for inference and interpretability. Meanwhile, KGs are difficult to construct and evolve by nature, which challenges the existing methods in KGs to generate new facts and represent unseen knowledge. Therefore, it is complementary to unify LLMs and KGs together and simultaneously leverage their advantages. In this article, we present a forward-looking roadmap for the unification of LLMs and KGs. Our roadmap consists of three general frameworks, namely, 1) KG-enhanced LLMs, which incorporate KGs during the pre-training and inference phases of LLMs, or for the purpose of enhancing understanding of the knowledge learned by LLMs;2) LLM-augmented KGs, that leverage LLMs for different KG tasks such as embedding, completion, construction, graph-to-text generation, and question answering;and 3) Synergized LLMs + KGs, in which LLMs and KGs play equal roles and work in a mutually beneficial way to enhance both LLMs and KGs for bidirectional reasoning driven by both data and knowledge. We review and summarize existing efforts within these three frameworks in our roadmap and pinpoint their future research directions. Copyright © 2023, The Authors. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-fuzzy-constrained Strong Simulation

arXiv

引用

arXiv 2021年

作者： Liu, Guliu Li, Lei Liu, Guanfeng Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology China Department of Computing Macquarie University Australia Mininglamp Academy of Sciences Mininglamp Technology China

Traditional social group analysis mostly uses interaction models, event models, or other methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic location, social relationships, and/or related events. However, in some applications, it is necessary to make more specific restrictions on the members and the interaction between members of the group. Generally, graph pattern matching (GPM) is used to solve this problem. However, the existing GPM methods rarely consider the rich contextual information of nodes and edges to measure the credibility between members. In this paper, a social group query problem that needs to consider the trust between members of the group is proposed. To solve this problem, we propose a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence. Aiming at the inefficiency of the NTSS algorithm when matching pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matched edges shared by multiple matching subgraphs, two optimization strategies are proposed. Finally, we conduct verification experiments on the effectiveness and efficiency of the NTSS algorithm and the algorithms with the optimization strategies on four social network datasets in real applications. Experimental results show that the NTSS algorithm is significantly better than the existing multi-constrained GPM algorithm, and the NTSS_Inv_EdgC algorithm, which combines two optimization strategies, greatly improves the efficiency of the NTSS algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

DIPR: Efficient Point Cloud Registration via Dynamic Iteration

arXiv

引用

arXiv 2023年

作者： Ai, Yang Bai, Qiang Li, Jindong Yang, Xi School of Artificial Intelligence Jilin University China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence MoE China Key Laboratory of Ancient Chinese Script Culture Relics and Artificial Intelligence Jilin University China

Point cloud registration (PCR) is an essential task in 3D vision. Existing methods achieve increasingly higher accuracy. However, a large proportion of non-overlapping points in point cloud registration consume a lot of computational resources while negatively affecting registration accuracy. To overcome this challenge, we introduce a novel Efficient Point Cloud Registration via Dynamic Iteration framework, DIPR, that makes the neural network interactively focus on overlapping points based on sparser input points. We design global and local registration stages to achieve efficient course-to-fine processing. Beyond basic matching modules, we propose the Refined Nodes to narrow down the scope of overlapping points by using adopted density-based clustering to significantly reduce the computation amount. And our SC Classifier serves as an early-exit mechanism to terminate the registration process in time according to matching accuracy. Extensive experiments on multiple datasets show that our proposed approach achieves superior registration accuracy while significantly reducing computational time and GPU memory consumption compared to state-of-the-art methods. © 2023, CC BY-NC-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unsupervised vehicle re-identification with progressive adaptation

arXiv

引用

arXiv 2020年

作者： Peng, Jinjia Wang, Yang Wang, Huibing Zhang, Zhao Fu, Xianping Wang, Meng College of Information and Science Technology Dalian Maritime University LiaoningDalian China Pengcheng Laboratory ShenzhenGuangdong China Key Laboratory of Knowledge Engineering with Big Data Ministry of education Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

Vehicle re-identification (reID) aims at identifying vehicles across different non-overlapping cameras views. The existing methods heavily relied on well-labeled datasets for ideal performance, which inevitably causes fateful drop due to the severe domain bias between the training domain and the real-world scenes;worse still, these approaches required full annotations, which is labor-consuming. To tackle these challenges, we propose a novel progressive adaptation learning method for vehicle reID, named PAL, which infers from the abundant data without annotations. For PAL, a data adaptation module is employed for source domain, which generates the images with similar data distribution to unlabeled target domain as "pseudo target samples". These pseudo samples are combined with the unlabeled samples that are selected by a dynamic sampling strategy to make training faster. We further proposed a weighted label smoothing (WLS) loss, which considers the similarity between samples with different clusters to balance the confidence of pseudo labels. Comprehensive experimental results validate the advantages of PAL on both VehicleID and VeRi-776 dataset. Copyright © 2020, The Authors. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：