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

Computationally Efficient Approximations for Matrix-based Rényi's Entropy

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gong, Tieliang Dong, Yuxin Yu, Shujian Dong, Bo The School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an710049 China The Machine Learning Group UiT - The Arctic University of Norway Department of Computer Science Vrije University Amsterdam Amsterdam Netherlands

The recently developed matrix-based Rényi's αorder entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi-definite (PSD) matrices in reproducing kernel Hilbert space, without estimation of the underlying data distribution. This intriguing property makes this new information measurement widely adopted in multiple statistical inference and learning tasks. However, the computation of such quantity involves the trace operator on a PSD matrix G to power α (i.e., tr(Gα)), with a normal complexity of nearly O(n3), which severely hampers its practical usage when the number of samples (i.e., n) is large. In this work, we present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than O(n2). To this end, we leverage the recent progress on Randomized Numerical Linear Algebra, developing Taylor, Chebyshev and Lanczos approximations to tr(Gα) for arbitrary values of α by converting it into a matrix-vector multiplication problem. We also establish the connection between the matrix-based Rényi's entropy and PSD matrix approximation, which enables exploiting both clustering and block low-rank structure of G to further reduce the computational cost. We theoretically provide approximation accuracy guarantees and illustrate the properties for different approximations. Large-scale experimental evaluations on both synthetic and real-world data corroborate our theoretical findings, showing promising speedup with negligible loss in accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

data-Centric Evolution in Autonomous Driving: A Comprehensive Survey of Big data System, data Mining, and Closed-Loop Technologies

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Lincan Shao, Wei Dong, Wei Tian, Yijun Yang, Kaixiang Zhang, Wenjie Data and Knowledge Research Group University of New South Wales Sydney Australia Data61 CSIRO ClaytonVIC Australia BYD Intelligent Driving R&D Centre Shenzhen China University of Notre Dame South Bend United States School of Computer Science & Engineering South China University of Technology Guangzhou China

The aspiration of the next generation’s autonomous driving (AD) technology relies on the dedicated integration and interaction among intelligent perception, prediction, planning, and low-level control. There has been a huge bottleneck regarding the upper bound of autonomous driving algorithm performance, a consensus from academia and industry believes that the key to surmount the bottleneck lies in data-centric autonomous driving technology. Recent advancement in AD simulation, closed-loop model training, and AD big data engine have gained some valuable experience. However, there is a lack of systematic knowledge and deep understanding regarding how to build efficient data-centric AD technology for AD algorithm self-evolution and better AD big data accumulation. To fill in the identified research gaps, this article will closely focus on reviewing the state-of-the-art data-driven autonomous driving technologies, with an emphasis on the comprehensive taxonomy of autonomous driving datasets characterized by milestone generations, key features, data acquisition settings, etc. Furthermore, we provide a systematic review of the existing benchmark closed-loop AD big data pipelines from the industrial frontier, including the procedure of closed-loop frameworks, key technologies, and empirical studies. Finally, the future directions, potential applications, limitations and concerns are discussed to arouse efforts from both academia and industry for promoting the further development of autonomous driving. Copyright © 2024, The Authors. All rights reserved.

关键词： Autonomous vehicles

Unsupervised Keyword Extraction Method Based on Chinese Patent Clustering

学校读者我要写书评

暂无评论

Unsupervised Keyword Extraction Method Based on Chinese Pate...

IEEE International Conference on Big knowledge (ICBK)

作者： Yuxin Xie Xuegang Hu Yuhong Zhang Shi Li Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China Intelligent Connected Vehicle Research Institute (JAC Technical Center) Anhui Jianghuai Automobile Group Corp.Ltd Hefei China

Recently, patent data analysis has attracted a lot of attention, and patent keyword extraction is a hot problem. Most existing methods for patent keyword extraction are based on the frequency of words without semantic information. In this paper, we propose an Unsupervised Keyword Extraction Method (UKEM) based on Chinese patent clustering. More specifically, we use a Skip-gram model to train word embeddings based on a Chinese patent corpus. Then each patent is represented as a vector called patent vector. These patent vectors are clustered to obtain several cluster centroids. Next, the distance between each word vector in patent abstract and cluster centroid is computed to indicate the semantic importance of this word. The experimental results on several Chinese patent datasets show that the performance of our proposed method is better than several competitive methods.

关键词： Patents Semantics data mining knowledge engineering Neural networks Big data Computer science

Detection of ChatGPT Fake Science with the xFakeSci Learning Algorithm

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hamed, Ahmed Abdeen Wu, Xindong Complex Adaptive Systems and Computational Intelligence Laboratory State University of New York at Binghamton BinghamtonNY13902 United States Sano Centre for Computational Medicine Clinical Data Science Cracow30-072 Poland Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei230009 China China Electronics Data Industry Group Shenzhen518057 China

Generative AI tools exemplified by ChatGPT are becoming a new reality. This study is motivated by the premise that "AI generated content may exhibit a distinctive behavior that can be separated from scientific articles". In this study, we show how articles can be generated using means of prompt engineering for various diseases and conditions. We then show how we tested this premise in two phases and prove its validity. Subsequently, we introduce xFakeSci, a novel learning algorithm, that is capable of distinguishing ChatGPT-generated articles from publications produced by scientists. The algorithm is trained using network models driven from both sources. To mitigate overfitting issues, we incorporated a calibration step that is built upon data-driven heuristics, including proximity and ratios. Specifically, from a total of a 3952 fake articles for three different medical conditions, the algorithm was trained using only 100 articles, but calibrated using folds of 100 articles. As for the classification step, it was performed using 300 articles per condition. The actual label steps took place against an equal mix of 50 generated articles and 50 authentic PubMed abstracts. The testing also spanned publication periods from 2010 to 2024 and encompassed research on three distinct diseases: cancer, depression, and Alzheimer’s. Further, we evaluated the accuracy of the xFakeSci algorithm against some of the classical data mining algorithms (e.g., Support Vector Machines, Regression, and Naive Bayes). The xFakeSci algorithm achieved F1 scores ranging from 80% to 94%, outperforming common data mining algorithms, which scored F1 values between 38% and 52%. We attribute the noticeable difference to the introduction of calibration and a proximity distance heuristic, which underscores this promising performance. Indeed, the prediction of fake science generated by ChatGPT presents a considerable challenge. Nonetheless, the introduction of the xFakeSci algorithm is a significant st

关键词： Learning algorithms

Reproducibility and Geometric Intrinsic Dimensionality: An Investigation on Graph Neural Network Research

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hille, Tobias Stubbemann, Maximilian Hanika, Tom Knowledge & Data Engineering Group University of Kassel Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Kassel Germany Information Systems and Machine Learning Lab University of Hildesheim Hildesheim Germany Institute of Computer Science University of Hildesheim Hildesheim Germany

Difficulties in replication and reproducibility of empirical evidences in machine learning research have become a prominent topic in recent years. Ensuring that machine learning research results are sound and reliable requires reproducibility, which verifies the reliability of research findings using the same code and data. This promotes open and accessible research, robust experimental workflows, and the rapid integration of new findings. Evaluating the degree to which research publications support these different aspects of reproducibility is one goal of the present work. For this we introduce an ontology of reproducibility in machine learning and apply it to methods for graph neural networks. Building on these efforts we turn towards another critical challenge in machine learning, namely the curse of dimensionality, which poses challenges in data collection, representation, and analysis, making it harder to find representative data and impeding the training and inference processes. Using the closely linked concept of geometric intrinsic dimension we investigate to which extend the used machine learning models are influenced by the intrinsic dimension of the data sets they are trained *** Codes 68T01 68T07 68T09 51F99 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

Discovering Shared Conceptualizations in Folksonomies

学校读者我要写书评

暂无评论

SSRN

SSRN 2018年

作者： Jäschke, Robert Hotho, Andreas Schmitz, Christoph Ganter, Bernhard Stumme, Gerd Knowledge & Data Engineering Group University of Kassel Wilhelmshöher Allee 73 Kassel34121 Germany Research Center L3S Appelstr. 9a Hannover30167 Germany Institute for Algebra Dresden University of Technology Dresden01062 Germany

Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualisations are not formalised, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualisations. Our approach extends the data mining task of discovering all closed itemsets to three- dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples. © 2018, The Authors. All rights reserved.

关键词： Ontology

Network properties of folksonomies

学校读者我要写书评

暂无评论

Network properties of folksonomies

作者： Cattuto, Ciro Schmitz, Christoph Baldassarri, Andrea Servedio, Vito D.P. Loreto, Vittorio Hotho, Andreas Grahl, Miranda Stumme, Gerd Knowledge and Data Engineering Group Dept. of Mathematics and Computer Science Univ. of Kassel Wilhelmshöher Allee 73 D-34121 Kassel Germany Dipartimento di Fisica Università di Roma La Sapienza P. le A. Moro 2 I-00185 Roma Italy Museo Storico della Fisica Centro Studi e Ricerche Enrico Fermi Compendio Viminale I-00184 Roma Italy

Social resource sharing systems like YouTube and *** have acquired a large number of users within the last few years. They provide rich resources for data analysis, information retrieval, and knowledge discovery applications. A first step towards this end is to gain better insights into content and structure of these systems. In this paper, we will analyse the main network characteristics of two of these systems. We consider their underlying data structures - so-called folksonomies - as tri-partite hypergraphs, and adapt classical network measures like characteristic path length and clustering coefficient to them. Subsequently, we introduce a network of tag co-occurrence and investigate some of its statistical properties, focusing on correlations in node connectivity and pointing out features that reflect emergent semantics within the folksonomy. We show that simple statistical indicators unambiguously spot non-social behavior such as spam. © 2007 - IOS Press and the authors. All rights reserved.

关键词： Information systems

Exploring choice overload in related-article recommendations in digital libraries

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Beierle, Felix Aizawa, Akiko Beel, Joeran Service-centric Networking Technische Universität Berlin Telekom Innovation Laboratories Berlin Germany Digital Content and Media Sciences Research Division Tokyo Japan Trinity College Dublin School of Computer Science and Statistics Intelligent Systems Discipline Knowledge and Data Engineering Group ADAPT Centre Dublin Ireland

We investigate the problem of choice overload – the difficulty of making a decision when faced with many options – when displaying related-article recommendations in digital libraries. So far, research regarding to how many items should be displayed has mostly been done in the fields of media recommendations and search engines. We analyze the number of recommendations in current digital libraries. When browsing fullscreen with a laptop or desktop PC, all display a fixed number of recommendations. 72% display three, four, or five recommendations, none display more than ten. We provide results from an empirical evaluation conducted with GESIS’ digital library Sowiport, with recommendations delivered by recommendations-as-a-service provider Mr. DLib. We use click-through rate as a measure of recommendation effectiveness based on 3.4 million delivered recommendations. Our results show lower click-through rates for higher numbers of recommendations and twice as many clicked recommendations when displaying ten instead of one related-articles. Our results indicate that users might quickly feel overloaded by choice. Copyright © 2017, The Authors. All rights reserved.

关键词： Digital libraries

Automatic Textual Explanations of Concept Lattices

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hirth, Johannes Horn, Viktoria Stumme, Gerd Hanika, Tom Knowledge & Data Engineering Group University of Kassel Germany Partizipative IT-Gestaltung University of Kassel Germany Interdisciplinary Research Center for Information System Design University of Kassel Germany School of Library and Information Science Humboldt-Universität zu Berlin Berlin Germany Institute of Computer Science University of Hildesheim Germany

Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by untrained users and in general in cases where lattices are large. We tackle this problem by automatically generating textual explanations for lattices using standard scales. Our method is based on the general notion of ordinal motifs in lattices for the special case of standard scales. We show the computational complexity of identifying a small number of standard scales that cover most of the lattice structure. For these, we provide textual explanation templates, which can be applied to any occurrence of a scale in any data domain. These templates are derived using principles from human-computer interaction and allow for a comprehensive textual explanation of lattices. We demonstrate our approach on the spices planner data set, which is a medium sized formal context comprised of fifty-six meals (objects) and thirty-seven spices (attributes). The resulting 531 formal concepts can be covered by means of about 100 standard *** Codes 06A15 03G10 68T30 68T27 Copyright © 2023, The Authors. All rights reserved.

关键词： Formal concept analysis