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

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haonan Miao Peizheng Zhao Yuqi Sun Fang Nan Xiaolong Zhang Yaqiang Wu Feng Tian School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China School of Advanced Technology Xi’an Jiaotong-Liverpool University Suzhou China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students’ gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods.

关键词： Three-dimensional displays Estimation Focusing Signal processing Acoustics Speech processing

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

INTEGRATING knowledge-BASED SYSTEMS AND dataBASES

引用

CLINICA CHIMICA ACTA 1993年第1-2期222卷 101-115页

作者： GRIMSON, JB Knowledge and Data Engineering Group Department of Computer Science Trinity College Dublin 2 Ireland

In recent years, there has been an explosion of interest among the computing community in the field of artificial intelligence, particularly in the areas of natural language processing and knowledge-based systems (KBS). The medical domain has seen the development of hundreds of KBSs and there is substantial evidence to show that the application of a knowledge-based approach to decision support can go a long way towards overcoming the information overload experienced by many clinicians today. Yet many of these medical KBSs are still at the prototype stage and are mainly confined to research laboratories. There are many reasons for this apparently slow take-up of the technology, but one of the most significant is the lack of integration into the regular routine information processing of the organisation, in particular the database processing. This paper discusses the benefits of such integration and methods for achieving it in the context of general trends in information systems. database technology provides efficient and secure management of large amounts of data in a multi-user, multiapplication environment. knowledge-based technology, on the other hand, provides mechanisms for building intelligent systems. Thus, for example, given a set of facts about a domain (symptoms, laboratory test results, etc.) together with a set of rules which apply to that domain (e.g.'if TT4 > 150 nmol/l then suspect hyperthyroidism'), a KBS can deduce new information about that domain automatically. The effective integration of these two technologies is seen as a means of achieving the intelligent information systems of the future. There are three basic approaches to integrating KBSs and databases. The first is to start with the KBS and incorporate data management functions. Alternatively, intelligence from the KBS can be incorporated into the database. Finally, the two systems can be allowed to coexist as independent systems which can talk to each other by means of standard interfaces.

关键词： dataBASE MANAGEMENT knowledge-BASED SYSTEMS EXPERT SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

A Depth-first Algorithm of Finding All Association Rules Generated by a Frequent Itemset

引用

Journal of Donghua University(English Edition) 2006年第6期23卷 1-4,9页

作者：武坤姜保庆魏庆 Institute of Data and Knowledge Engineering Henan University Institute of Data and Knowledge Engineering Henan University The Computer Science Department Henan University of Finance and Economics

The classical algorithm of finding association rules generated by a frequent itemset has to generate all non-empty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed an improved algorithm. The algorithm finds all consequents layer by layer, so it is breadth-first. In this paper, we propose a new algorithm Generate Rules by using Set-Enumeration Tree (GRSET) which uses the structure of Set-Enumeration Tree and depth-first method to find all consequents of the association rules one by one and get all association rules correspond to the consequents. Experiments show GRSET algorithm to be practicable and efficient.

关键词： association rule frequent itemset breath-first,depth-first consequent.

来源：评论

学校读者我要写书评

暂无评论

Towards the Technology Neutral Modeling of Management Components

引用

Journal of Network and Systems Management 2003年第1期11卷 39-56页

作者： Lewis, David Wade, Vincent Cullen, Brian Knowledge and Data Engineering Group Department of Computer Science Trinity College Dublin Dublin 2 Ireland

This paper outlines an Architectural Model and accompanying modeling notation that addresses on the need to model management component interfaces and their business contexts in a technology neutral manner in order to promote convergence on stable, reusable solutions. The approach combines existing modeling concepts related to component-based and model-driven software development from TINA-C, OMG, DMTF and TM Forum in order to provide guidance on the development of models that need to be exchanged between organizations involved in the development of software components and the management systems in which they are used. The Architectural Model is assessed through application to the management a specific set of e-business support services.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

Integrating the policy dialectic into dynamic spectrum management

Integrating the policy dialectic into dynamic spectrum manag...

引用

2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks

作者： Lewis, David Feeney, Kevin O'Sullivan, Declan Knowledge and Data Engineering Group Department of Computer Science and Statistics Ireland CTVR Ireland Knowledge and Data Engineering Group (KDEG) Department of Computer Science and Statistics TCD Ireland

ISBN: (纸本)9781424406623

In this paper we propose a holistic approach to modeling the management of dynamic spectrum access (DSA). We argue that the range to issues involved requires not just a management scheme, but also a meta-management scheme whereby management processes are monitored, analyzed and improved. In this way different proposals for management can be refined through interaction in a dialectic that reacts to the problems and conflicts of a given management scheme as well as the changes in the technological, social, economic and political environment. We examine Stafford Beer's Viable Systems Model as a possible basis for a framework that encompasses a variety of feedback loops involved in addressing operations, management and meta-management together. We also propose how this model could be mapped onto a concrete policy meta-management system and sketch out issues worthy of further investigation in developing a holistic DSA management framework.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Explainable robotics applied to bipedal walking gait development 31

Explainable robotics applied to bipedal walking gait develop...

引用

31st Benelux Conference on Artificial Intelligence and the 28th Belgian Dutch Conference on Machine Learning, BNAIC/BENELEARN 2019

作者： Roos, Nico Sun, Zhenglong Data Science and Knowledge Engineering Maastricht University Netherlands

Explainability is becoming an important topic in artificial intelligence (AI). A well explainable system can increase the trust in the application of that system. The same holds for robotics where the walking gait controller can be some AI system. We will show that a simple and explainable controller that enables an energy efficient walking gait and can handle uneven terrains, can be developed by a well structured design method. The main part of the controller consist of three simple neural networks with 4, 6 and 8 neurons. So, although creating a stable and energy efficient walking gait is a complex problem, it can be generated without some deep neural network or some complex mathematical model. © 2019 for this paper by its authors.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Mining Maximal Frequent Patterns in a Unidirectional FP-tree

引用

Journal of Donghua University(English Edition) 2006年第6期23卷 105-109页

作者：宋晶晶刘瑞新王艳姜保庆 Institute of Data and Knowledge Engineering Henan University Information Engineering Science Department Yellow River Conservancy Technical Institute

Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model only finds out the maximal frequent patterns, which can generate all frequent patterns. FP-growth algorithm is one of the most efficient frequent-pattern mining methods published so far. However, because FP-tree and conditional FP-trees must be two-way traversable, a great deal memory is needed in process of mining. This paper proposes an efficient algorithm Unid_FP-Max for mining maximal frequent patterns based on unidirectional FP-tree. Because of generation method of unidirectional FP-tree and conditional unidirectional FP-trees, the algorithm reduces the space consumption to the fullest extent. With the development of two techniques: single path pruning and header table pruning which can cut down many conditional unidirectional FP-trees generated recursively in mining process, Unid_FP-Max further lowers the expense of time and space.

关键词： data mining frequent pattern the maximal frequent pattern Unid _ FP-tree conditional Unid _ FP-tree.

来源：评论

学校读者我要写书评

暂无评论

On sorting with a network of two stacks 19

On sorting with a network of two stacks

引用

19th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2019

作者： Mihalák, Matúš Pont, Marc Department of Data Science and Knowledge Engineering Maastricht University Netherlands

ISBN: (纸本)9783959771283

Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by pushing and popping the numbers to and from a given set of stacks. Multiple concrete decision or optimization questions are formed by restricting the access to the stacks. The motivation comes, e.g., from shunting train wagons in shunting yards, shunting trams in depots, or in stacking cargo containers on cargo ships or storage yards in transshipment terminals. We consider the problem of sorting a permutation of n integers 1, 2, . . ., n using k ≥ 2 stacks. In this problem, elements from the input sequence are pushed one-by-one (in the order of the elements in the sequence) to one of the k stacks. At any time, an element from a stack can be popped and pushed to another stack;such an operation is called a shuffle. Also, at any time, an element can be popped from a stack and placed to the output sequence. We can only place the elements to the output in the increasing order of their value such that at the end the output is the ordered sequence of the elements. The problem asks to minimize the number of shuffles in the process. It is known that for k ≥ 4, the problem is NP-hard, and that there is no approximation algorithm unless P=NP. For k ≥ 3, it is known that at most O(n log n) shuffles are needed for any input sequence. For the case when k = 2, there exist input sequences that require Ω(n2−Ε) shuffles, for any Ε > 0. Nothing substantially more is known for the case of k = 2. In this paper, we study the following variant of the problem with k = 2 stacks: no shuffle and no placement to the output sequence can happen before every element is in one of the two stacks. We show that our problem can be seen as the MinUnCut problem by providing a polynomial-time reduction, and thus we show that there exists a randomized O(√log n)-approximation algorithm and a deterministic O(log n)-approximation algorithm for our problem. © Matúš Mihalák and Marc Pont;licensed under Creative Comm

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Classification on 12, 6, 4, 3 and 2 Lead Electrocardiography Signals Using Convolutional Recurrent Neural Networks

Multi-Label Classification on 12, 6, 4, 3 and 2 Lead Electro...

引用

2021 Computing in Cardiology, CinC 2021

作者： Osnabrugge, Niels Keresztesi, Kata Rustemeyer, Felix Kaparakis, Christos Battipaglia, Francesca Bonizzi, Pietro Karel, Joel Maastricht University Department of Data Science and Knowledge Engineering Netherlands

ISBN: (纸本)9781665479165

Automatic identification of cardiac abnormalities through the ECG with a reduced lead system (less than the standard 12-lead) can provide a valuable easy to use and lower cost diagnostic alternative to ordinary 12-lead ECG devices. This study investigates the use of Convolutional Recurrent Neural Networks (CRNNs) to identify cardiac abnormalities in 12, 6, 4, 3 and 2 lead ECG data. Multi-label classification with CRNNs relies on effective data pre-processing, model architecture and hyperparameter tuning. ECG signals were first pre-processed and then zero-padded or clipped to have an equal duration of 10 seconds). Additionally, a wavelet-based ECG segmentation algorithm was used to extract the characteristics and locations of the PQRST complexes (features), and both PQRST fiducial points and extracted features were used as inputs to two Convolutional Recurrent Neural Networks (CRNN), respectively, each one consisting of eight layers. The two CRNNs were subsequently concatenated. Final challenge results of the proposed method achieved an official score of -0.35 for the all-lead combination and a rank of 36 (team name: heartMAASters). In the discussion we provide some theoretical considerations on why we would expect the enhanced model to show a better performance. © 2021 Creative Commons.

关键词： Electrocardiography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：