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

5th International Conference on Cognitive Systems and Signal Processing, ICCSIP 2020

作者： Wang, Hao Wang, Le Fang, Baofu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230009 China Department of Computer Science and Technology Hefei University of Technology Hefei Anhui230009 China

ISBN: (纸本)9789811623356

Traditional vision-based simultaneous localization and mapping (SLAM) technology cannot obtain the semantic information of the surrounding environment, which will cause the robot to fail to complete intelligent grasping, human-computer interaction, and other advanced decision tasks. There are many challenges to solve this problem, such as obtaining less semantic information of the environment with low precision and being unable to deal with dynamic objects in a real environment quickly and effectively. In this paper, a robust visual odometry using semantic information in complex dynamic scenes was designed. Specifically, we present a refined instance segmentation method based on the contextual information of the frame to improve the accuracy of segmentation. On this basis, a feature detection and elimination algorithm for dynamic objects based on instance-level semantic information is proposed to improve the localization accuracy of camera pose. We extensively evaluate our system on the public TUM data set and compare it with ORB-SLAM2 and other methods. Experiments show that our methods greatly improve the localization accuracy of the camera pose and the robustness of the system, which verifies that our system is effective in complex dynamic scenes. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Massive open online courses temporal profiling for dropout prediction

arXiv

引用

arXiv 2017年

作者： Hagedoorn, Tom Rolandus Spanakis, Gerasimos Department of Data Science and Knowledge Engineering Maastricht University 6200MD Netherlands

Massive Open Online Courses (MOOCs) are attracting the attention of people all over the world. Regardless the platform, numbers of registrants for online courses are impressive but in the same time, completion rates are disappointing. Understanding the mechanisms of dropping out based on the learner profile arises as a crucial task in MOOCs, since it will allow intervening at the right moment in order to assist the learner in completing the course. In this paper, the dropout behaviour of learners in a MOOC is thoroughly studied by first extracting features that describe the behavior of learners within the course and then by comparing three classifiers (Logistic Regression, Random Forest and AdaBoost) in two tasks: Predicting which users will have dropped out by a certain week and predicting which users will drop out on a specific week. The former has showed to be considerably easier, with all three classifiers performing equally well. However, the accuracy for the second task is lower, and Logistic Regression tends to perform slightly better than the other two algorithms. We found that features that reflect an active attitude of the user towards the MOOC, such as submitting their assignment, posting on the Forum and filling their Profile, are strong indicators of persistence. Copyright © 2017, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Top-k entities query processing on uncertainly fused multi-sensory data

Top-k entities query processing on uncertainly fused multi-s...

引用

作者： Liu, Dexi Wan, Changxuan Xiong, Naixue Park, Jong Hyuk Rho, Seungmin Jiangxi Key Laboratory of Data and Knowledge Engineering School of Information Technology Jiangxi University of Finance and Economics Nanchang China Department of Computer Science Georgia State University Atlanta GA United States Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of School of Electrical Engineering Korea University Seoul Korea Republic of

Sensor fusion is the combining of sensory data from disparate sources such that the resulting information is in some sense better than would be possible when these sources were used individually. The natural uncertainty exists in these data because sensors are not precise enough. Hence, the intuitive method to store this kind of data is using uncertain database. Finding the top-k entities according to one or more attributes is a powerful technique when the uncertain database contains large quantity of data. However, compared to top-k in traditional databases, queries over uncertain database are more complicated because of the existence of exponential possible worlds. We propose a method to process entity-based global top-k aggregate queries in uncertain database, which returns the top-k entities that have the highest aggregate value. Our method has two levels, entity state generation and G-topk-E query processing. In the former level, entity states, which satisfy the properties of x-tuple, are generated one after the other according to their aggregate values, while in the latter level, dynamic programming-based global top-k entity query processing is employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. © 2012 Springer-Verlag London Limited.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Using Machine Learning with Pyspark for Solving a Big data Problem: Searching for Particles in High Energy Physics with Big Mass (HEPMASS) 7th

Using Machine Learning with Pyspark for Solving a Big Dat...

引用

7th International Conference on Smart City Applications, SCA 2022

作者： Azhari, Mourad Ahaji, Khalid Abarda, Abdallah Ettaki, Badia Zerouaoui, Jamal Center of Guidance and Planning Rabat Morocco Laboratoire de Modélisation Mathématiques et de Calculs Economiques FSJES Université Hassan 1er Settat Morocco Laboratory of Research in Computer Science Data Sciences and Knowledge Engineering Department of Data Content and Knowledge Engineering School of Information Sciences Rabat Morocco Laboratory of Engineering Sciences and Modeling Faculty of Sciences Ibn Tofail University Kenitra Morocco

ISBN: (纸本)9783031268519

The search for exotic particles is one of the most challenging topics for physicists. This work aims to resolve the Big data problem in the exotic particle area using the Apache Spark environment with the MLlib library. For this purpose, we analyze and discuss the performance of the following methods: Logistic Regression (LR), Decision Tree (DT), Random Forest (RF), and Gradient Boosted Tree (GBT). The results are very encouraging and prove that these proposed methods run efficiently with an Accuracy exceeding (83%). While the Gradient Boosted Tree (GBT) reaches a high AUC score 85%, better than Decision Tree (DT) and Random Forest. In this manuscript, we attempt to solve a big data problem using the "HEPMASS" dataset. Our data includes 10.5 million examples collected from the UCI website for the experimental phase. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in Computer science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Collective fast delivery by energy-efficient agents

arXiv

引用

arXiv 2018年

作者： Bärtschi, Andreas Graf, Daniel Mihalák, Matúš ETH Zürich Department of Computer Science Switzerland Department of Data Science and Knowledge Engineering Maastricht University Netherlands

We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths). The agents have to deliver a single item from a given source node s to a given target node t. The agents can move along the edges of the graph, starting at time 0, with respect to the following: Each agent i has a weight ωithat defines the rate of energy consumption while travelling a distance in the graph, and a velocity νiwith which it can move. We are interested in schedules (operating the k agents) that result in a small delivery time Τ (time when the item arrives at t), and small total energy consumption ϵ. Concretely, we ask for a schedule that: either (i) Minimizes Τ, (ii) Minimizes lexicographically (Τ, ϵ) (prioritizing fast delivery), or (iii) Minimizes ϵ · Τ + (1 - ϵ) · ϵ, for a given ϵ ∈ (0, 1). We show that (i) is solvable in polynomial time, and show that (ii) is polynomial-time solvable for uniform velocities and solvable in time O(n + k log k) for arbitrary velocities on paths, but in general is NP-hard even on planar graphs. As a corollary of our hardness result, (iii) is NP-hard, too. We show that there is a 3-approximation algorithm for (iii) using a single agent. Copyright © 2018, The Authors. All rights reserved.

关键词： Mobile agents

来源：评论

学校读者我要写书评

暂无评论

Towards A knowledge Graph-based Exploratory Search for Privacy engineering 8

Towards A Knowledge Graph-based Exploratory Search for Priva...

引用

8th International Workshop on the Visualization and Interaction for Ontologies, Linked data and knowledge Graphs, VOILA! 2023

作者： Herwanto, Guntur Budi Ekaputra, Fajar J. Piroi, Florina Sabou, Marta Faculty of Computer Science University of Vienna Austria Department of Computer Science and Electronics Universitas Gadjah Mada Indonesia Institute of Information Systems Engineering Faculty of Informatics TU Wien Austria Institute of Data Process and Knowledge Management WU Wien Austria

The concept of privacy-by-design has gained considerable attention in the wake of legal requirements that software systems should fulfill. The interconnected knowledge on privacy concepts, legal requirements, and software development artifacts required to implement this concept can be a major burden for organizations. To address this challenge, we propose a knowledge graph-based Exploratory Search system to help organizations complete privacy engineering tasks. We identify major requirements of such systems and develop an Exploratory Search prototype built on privacy engineering knowledge that integrates different information sources. While still preliminary, this work serves as a foundation for future research on integrating privacy knowledge into software development and demonstrates the potential of Exploratory Search Systems to support the cognitive process in privacy tasks such as privacy threat identification. © 2023 Copyright for this paper by its authors.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Edge-Minimum Saturated k-Planar Drawings 29th

Edge-Minimum Saturated k-Planar Drawings

引用

29th International Symposium on Graph Drawing and Network Visualization, GD 2021

作者： Chaplick, Steven Klute, Fabian Parada, Irene Rollin, Jonathan Ueckerdt, Torsten Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands Utrecht University Utrecht Netherlands TU Eindhoven Eindhoven Netherlands Department of Mathematics and Computer Science FernUniversität in Hagen Hagen Germany Institute of Theoretical Informatics Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (纸本)9783030929305

For a class D of drawings of loopless (multi-)graphs in the plane, a drawing D∈ D is saturated when the addition of any edge to D results in D′∉ D —this is analogous to saturated graphs in a graph class as introduced by Turán (1941) and Erdős, Hajnal, and Moon (1964). We focus on k-planar drawings, that is, graphs drawn in the plane where each edge is crossed at most k times, and the classes D of all k-planar drawings obeying a number of restrictions, such as having no crossing incident edges, no pair of edges crossing more than once, or no edge crossing itself. While saturated k-planar drawings are the focus of several prior works, tight bounds on how sparse these can be are not well understood. We establish a generic framework to determine the minimum number of edges among all n-vertex saturated k-planar drawings in many natural classes. For example, when incident crossings, multicrossings and selfcrossings are all allowed, the sparsest n-vertex saturated k-planar drawings have 2k-(kmod2)(n-1) edges for any k≥ 4, while if all that is forbidden, the sparsest such drawings have 2(k+1)k(k-1)(n-1) edges for any k≥ 6. © 2021, Springer Nature Switzerland AG.

关键词： Drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

data Cleaning of Binary Sensor Events in Activity Recognition by Cluster-Based Methods 7th

Data Cleaning of Binary Sensor Events in Activity Recognitio...

引用

7th International Conference on Human Aspects of IT for the Aged Population, ITAP 2021, held as part of the 23rd International Conference, HCI International 2021

作者： Zhao, Chunyang Que, Xia Yin, Yue Xing, Xiaoman Yang, Jiaoyun An, Ning Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Medical Imaging Department Chinese Academy of Sciences Suzhou China

ISBN: (纸本)9783030781101

The Ambient Assisted Living (AAL) systems use sensors to detect the daily behavior of older adults and provide necessary assistance based on changes in their cognitive status and physical functions, thus enabling older adults to maintain their independence at home. However, the effectiveness of the AAL systems depends on the accuracy of the data provided by sensors. Namely, when a human error or a hardware failure occurs, the activity recognition model can become inaccurate. This inaccuracy hinders the identification of critical and potentially life-threatening activities. Although there are many methods for cleaning sensor data, there is no method for binary sensors deployed in smart homes. By considering noisy sensor events and unintentional forgetting of turning off the device, this paper proposes two clustering-based methods for denoising and splitting binary sensor events to address possible inaccuracy due to the two mentioned problems. The effectiveness of the proposed methods is verified by the experiments using four machine learning models and three real-world smart home datasets and adopting different sensor configurations. The experimental results demonstrate that compared to the original unprocessed datasets, by combining the two proposed methods, the average accuracy and F-measure are improved by 15.00% and 17.25%, respectively. © 2021, Springer Nature Switzerland AG.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Mining complex event patterns in computer networks

Mining complex event patterns in computer networks

引用

1st International Workshop on New Frontiers in Mining Complex Patterns, NFMCP 2012

作者： Seipel, Dietmar Neubeck, Philipp Köhler, Stefan Atzmueller, Martin University of Würzburg Department of Computer Science Germany Google Germany GmbH Munich Germany Infosim GmbH and Co. KG Würzburg Germany University of Kassel Knowledge and Data Engineering Group Germany

ISBN: (纸本)9783642373817

More and more ubiquitous and mobile computer networks are becoming available, which leads to a massive growth in the amount of traffic and according log messages. Therefore, sophisticated approaches for network management and analysis are necessary for handling and managing networks efficiently. In this paper, we show how to use temporal data mining in a declarative framework for analysing log files for computer networks. From a sequence of network management protocol messages, we derive temporal association rules, which state frequent dependencies between the occuring events. We also present methods for extendable and modular parsing of text messages and their analysis in log files based on Xml. © 2013 Springer-Verlag.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：