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

arXiv 2023年

作者： Liu, Yixuan Zhao, Suyun Xiong, Li Liu, Yuhan Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China China Engineering Research Center Ministry of Education on Database and BI China Information School Renmin University of China China Department of Computer Science Emory University United States

Federated Learning, as a popular paradigm for collaborative training, is vulnerable against privacy attacks. Different privacy levels regarding users’ attitudes need to be satisfied locally, while a strict privacy guarantee for the global model is also required centrally. Personalized Local Differential Privacy (PLDP) is suitable for preserving users’ varying local privacy, yet only provides a central privacy guarantee equivalent to the worst-case local privacy level. Thus, achieving strong central privacy as well as personalized local privacy with a utility-promising model is a challenging problem. In this work, a general framework (APES) is built up to strengthen model privacy under personalized local privacy by leveraging the privacy amplification effect of the shuffle model. To tighten the privacy bound, we quantify the heterogeneous contributions to the central privacy user by user. The contributions are characterized by the ability of generating "echos" from the perturbation of each user, which is carefully measured by proposed methods Neighbor Divergence and Clip-Laplace Mechanism. Furthermore, we propose a refined framework (S-APES) with the post-sparsification technique to reduce privacy loss in high-dimension scenarios. To the best of our knowledge, the impact of shuffling on personalized local privacy is considered for the first time. We provide a strong privacy amplification effect, and the bound is tighter than the baseline result based on existing methods for uniform local privacy. Experiments demonstrate that our frameworks ensure comparable or higher accuracy for the global model. © 2023, CC BY.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Improved factor analysis algorithm in factor spaces

Improved factor analysis algorithm in factor spaces

引用

2014 International Conference on Informatics, Networking and Intelligent Computing(INIC 2014)

作者： H.D.Wang Y.Shi P.Z.Wang H.T.Liu Key Research Lab on Big Data Mining and Knowledge Management Chinese Academy of SciencesBeijingChina Research Center on Fictitious Economy & Data ScienceChinese Academy of SciencesBeijingChina School of Mathematical SciencesUniversity of Chinese Academy of Sciences Institute of Intelligent Engineering and Mathematics Liaoning Technical University

In order to further improve the velocity and the utilization of information contained in samples,an improved version of the Factor Analysis Algorithm(FAA) in factor spaces is presented in this *** primary algorithm is considered from the whole classes during the selection of the next classified factor,by which a smaller decision domain is generated than that generated by considering from each class,and the deletion of the decision domain is critical in decreasing calculation and increasing the velocity of the ***,based on inheriting the merits of the initial algorithm,the pushing way by each column is changed into that by each class during the selection of the next classified *** change not only decreases the calculation,but also improves the utilization of the sample *** testing results also indicate that the improvement is significant and the testing accuracy rate and velocity are both better than the primary algorithm.

关键词： Factor spaces factor analysis decision domain time complexity

来源：评论

学校读者我要写书评

暂无评论

data augmentation in microscopic images for material data mining

引用

npj Computational Materials 2020年第1期6卷 601-609页

作者： Boyuan Ma Xiaoyan Wei Chuni Liu Xiaojuan Ban Haiyou Huang Hao Wang Weihua Xue Stephen Wu Mingfei Gao Qing Shen Michele Mukeshimana Adnan Omer Abuassba Haokai Shen Yanjing Su Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology BeijingBeijing 100083China School of Computer and Communication Engineering University of Science and Technology BeijingBeijing 100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing 100083China Institute for Advanced Materials and Technology University of Science and Technology BeijingBeijing 100083China School of Materials Science and Engineering University of Science and Technology BeijingBeijing 100083China School of Materials Science and Technology Liaoning Technical UniversityLiaoning 114051China The Institute of Statistical Mathematics Research Organization of Information and SystemsTachikawaTokyo 190-8562Japan National Intellectual Property Administration Beijing 100088China Faculty of Engineering Sciences University of BurundiBujumburaBurundi Faculty of Engineering and Technology Palestine Technical University–KadoorieTulkaremPalestine College of Information Science and Engineering China University of PetroleumBeijingChina Key Lab of Petroleum Data Mining China University of PetroleumBeijingChina

Recent progress in material data mining has been driven by high-capacity models trained on large ***,collecting experimental data(real data)has been extremely costly owing to the amount of human effort and expertise ***,we develop a novel transfer learning strategy to address problems of small or insufficient *** strategy realizes the fusion of real and simulated data and the augmentation of training data in a data mining *** a specific task of grain instance image segmentation,this strategy aims to generate synthetic data by fusing the images obtained from simulating the physical mechanism of grain formation and the“image style”information in real *** results show that the model trained with the acquired synthetic data and only 35%of the real data can already achieve competitive segmentation performance of a model trained on all of the real *** the time required to perform grain simulation and to generate synthetic data are almost negligible as compared to the effort for obtaining real data,our proposed strategy is able to exploit the strong prediction power of deep learning without significantly increasing the experimental burden of training data preparation.

关键词： mining instance competitive

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Ordinal Motifs in Lattices

arXiv

引用

arXiv 2023年

作者： Hirth, Johannes Horn, Viktoria Stumme, Gerd Hanika, Tom Knowledge & Data Engineering Group University of Kassel Germany Gender/Diversity in Informatiksystemen University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany Intelligent Information Systems University of Hildesheim Germany

Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of understandably large parts. With the present work we propose /ordinal motifs/ as analytical units of meaning. We study these ordinal substructures (or standard scales) through order-embeddings and (full) scale-measures of formal contexts from the field of formal concept analysis. We show that the underlying decision problems are NP-complete and provide results on how one can incrementally identify ordinal motifs to save computational effort. Accompanying our theoretical results, we demonstrate how ordinal motifs can be leveraged to achieve textual explanations based on principles from human computer *** Codes 06A15 03G10 68T30 68T27 Copyright © 2023, The Authors. All rights reserved.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Two Complex Ontologies in Air Traffic Management

A Comparative Study of Two Complex Ontologies in Air Traffic...

引用

Conference on Digital Avionics Systems (DASC)

作者： Eduard Gringinger Richard M. Keller Audun Vennesland Christoph G. Schuetz Bernd Neumayr Corporate Research Frequentis AG Vienna Austria Intelligent Systems Division NASA Ames Research Center Moffet Field CA USA Software Engineering Safety and Security SINTEF Trondheim Norway Institute of Business Informatics - Data & Knowledge Engineering Johannes Kepler University Linz Linz Austria

ISBN: (数字)9781728106496

ISBN: (纸本)9781728114972

Over the past 25 years, multiple different data models have been introduced to standardize information management and facilitate data exchange and integration in the aviation domain. As a next step in the evolution of aviation data management, ontologies capturing the semantics (concepts, properties, and relationships) have been produced based on those models. In this paper, we describe a study comparing two recently released and independently-developed complex ontologies focused on Air Traffic Management (ATM) - the NASA ATM Ontology and an ontology derived from the ATM Information Reference Model. We develop a methodology for manually comparing two ontologies and identifying what we describe as exact, light, and mismatches between concepts in the two ontologies. We also describe a classification scheme that characterizes mismatches in terms of the general reason for the mismatch. This approach can be applied to improve existing ATM ontologies and foster interoperability, which will benefit aviation stakeholders.

关键词： Information Exchange Models ATM Information Reference Model NASA ATM Ontology Ontology Matching Ontology Air traffic management Automatic Teller Machines classification scheme MISMATCH aviation data exchange data models Information management

来源：评论

学校读者我要写书评

暂无评论

Drawing order diagrams through two-dimension extension

arXiv

引用

arXiv 2019年

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Berlin School of Library and Information Science Humboldt University of Berlin Berlin Germany Knowledge and Data Engineering Group University of Kassel Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Kassel Germany

Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work we present the novel algorithm DimDraw to draw order diagrams. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of a corresponding *** Codes 68R10 06A07 Copyright © 2019, The Authors. All rights reserved.

关键词： Drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

On the usability of probably approximately correct implication bases

arXiv

引用

arXiv 2017年

作者： Borchmann, Daniel Hanika, Tom Obiedkov, Sergei Chair of Automata Theory Technische Universität Dresden Germany Knowledge & Data Engineering Group University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany National Research University Higher School of Economics Moscow Russia

We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases represent a suitable substitute for exact implication bases in practical use-cases. To this end, we quantitatively examine the behavior of probably approximately correct implication bases on artificial and real-world data sets and compare their precision and recall with respect to their corresponding exact implication bases. Using a small example, we also provide qualitative insight that implications from probably approximately correct bases can still represent meaningful knowledge from a given data *** Codes 03G10 68T27 Copyright © 2017, The Authors. All rights reserved.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

Penetration Effect of Informatization on Technological Progress in Logistics Industry: Empirical Evidence from Inter-provincial Panel data in China 9th

Penetration Effect of Informatization on Technological Progr...

引用

9th International Conference on Information Technology and Quantitative Management, ITQM 2022

作者： Gong, Yaling Tian, Xin Jiang, Zuoliang Jiao, Yamin School of Economics and Management Yuzhang Normal University Nanchang330103 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Shanghai Heading Information Engineering Co. Ltd. Shanghai201112 China Shanghai Winjoin Information Technology Co. Ltd. Shanghai200126 China

This paper investigates pervasiveness effect of information technology on the technological progress of logistics in China. Using panel data of 30-regions in China during 2008 to 2020, we propose both static and dynamic panel data models, and find both resource level and spreading rate of information technology have negative influences on technological progress of logistics. The resource level of information technology has a short-term effect on technological progress of logistics, whereas the spreading rate of information technology has a long-term effect. Moreover, the result reveals that the discordant problem of information construction of logistics between resource level and spreading rate cause the negative influence of information technology. © 2022 The Authors. Published by Elsevier B.V.

关键词： Industry 4.0

来源：评论

学校读者我要写书评

暂无评论

Web Mining: From Web to Semantic Web 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Bettina Berendt Andreas Hotho Dunja Mladenič Maarten Someren Myra Spiliopoulou Gerd Stumme

ISBN: (数字)9783540301233

ISBN: (纸本)9783540232582

In the last years, research on Web mining has reached maturity and has broadened in scope. Two different but interrelated research threads have emerged, based on the dual nature of the Web: – The Web is a practically in?nite collection of documents: The acquisition and - ploitation of information from these documents asks for intelligent techniques for information categorization, extraction and search, as well as for adaptivity to the interests and background of the organization or person that looks for information. – The Web is a venue for doing business electronically: It is a venue for interaction, information acquisition and service exploitation used by public authorities, n- governmental organizations, communities of interest and private persons. When observed as a venue for the achievement of business goals, a Web presence should be aligned to the objectives of its owner and the requirements of its users. This raises the demand for understandingWeb usage, combining it with other sources of knowledge inside an organization, and deriving lines of action. ThebirthoftheSemanticWebatthebeginningofthedecadeledtoacoercionofthetwo threadsintwoaspects:(i)theextractionofsemanticsfromtheWebtobuildtheSemantic Web;and(ii)theexploitationofthesesemanticstobettersupportinformationacquisition and to enhance the interaction for business and non-business purposes. Semantic Web mining encompasses both aspects from the viewpoint of knowledge discovery.

关键词： Artificial Intelligence database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) User Interfaces and Human Computer Interaction Computers and Society

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：