The classical algorithm of finding association rules generated by a frequent itemset has to generate all nonempty subsets of the frequent itemset as candidate set of consequents. Xiongfei Li aimed at this and proposed...
详细信息
The classical algorithm of finding association rules generated by a frequent itemset has to generate all nonempty 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 *** show GRSET algorithm to be practicable and efficient.
This paper introduces SWARMS, a tool for exploring domain knowledge in semantic web. By domain knowledge exploration, we mean searching for or navigating the knowledge in a specific domain. We have found, through an a...
详细信息
The effort to personalise eLearning has led to the development of sophisticated Adaptive Hypermedia (AH) systems that can adapt to many aspects of the learner's characteristics or explicit preferences. However, wh...
详细信息
ISBN:
(纸本)9781627483308
The effort to personalise eLearning has led to the development of sophisticated Adaptive Hypermedia (AH) systems that can adapt to many aspects of the learner's characteristics or explicit preferences. However, while many of these adaptations are grounded in sound pedagogical theories, it is unclear how effective such adaptations are in supporting everyday teaching and learning processes that take place in the classroom today. This paper presents a study that explores what teachers in the UK, who have been named by their colleagues as implementing best-practice in the classroom, expect from an eLearning platform that can adapt to the individual needs of their students. The result of the study shows that there are currently some discrepancies between the teachers' expectations and what adaptive hypermedia currently offers. The paper then concludes by describing how these discrepancies can be addressed in future AH systems.
This paper proposes a novel approach in integrating seemingly contradictory approaches of teaching and learning via collaborative and personalised learning activities by using augmented reality museum exhibits. The pa...
详细信息
ISBN:
(纸本)9781627483308
This paper proposes a novel approach in integrating seemingly contradictory approaches of teaching and learning via collaborative and personalised learning activities by using augmented reality museum exhibits. The paper highlights the benefits that computer supported collaborative learning and computer supported personalised learning bring or promise to bring to the learner. A proposal is given for a study that will setup a common ground for these two approaches via a location-aware augmented reality museum display. The principal aim of the study is to investigate how the process of learning collaboratively is intertwined with personalised experience of visiting the museum display. Ultimately, the result of the study will provide a new understanding of visitor's experience of museum displays, not only within the context of the museum's location, but also within the classroom where the visit truly begins and finishes.
Key frame extraction has been recognized as one of the important research issues in video information retrieval. Until now, in spite of a lot of research efforts on the key frame extraction for video sequences, existi...
详细信息
The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of compu...
详细信息
ISBN:
(纸本)1595932100
The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim). Copyright 2005 ACM.
Real life transaction data often miss some occurrences of items that are actually present. As a consequence some potentially interesting frequent patterns cannot be discovered, since with exact matching the number of ...
详细信息
Recursive elimination is an algorithm for finding frequent item sets, which is strongly inspired by the FP-growth algorithm and very similar to the H-mine algorithm. It does its work without prefix trees or any other ...
详细信息
ISBN:
(纸本)1595932100
Recursive elimination is an algorithm for finding frequent item sets, which is strongly inspired by the FP-growth algorithm and very similar to the H-mine algorithm. It does its work without prefix trees or any other complicated data structures, processing the transactions directly. Its main strength is not its speed (although it is not slow, even outperforms Apriori and Eclat on some data sets), but the simplicity of its structure. Basically all the work is done in one simple recursive function, which can be written with relatively few lines of code. Copyright 2005 ACM.
Since the beginning of the 21st century, knowledge has been accumulating at a tremendous speed. The amount of global books, literature, and data available has increased in astounding quantities. The traditional librar...
详细信息
Since the beginning of the 21st century, knowledge has been accumulating at a tremendous speed. The amount of global books, literature, and data available has increased in astounding quantities. The traditional library service system is no longer able to meet the requirements of the present reality. With the development of Internet and rapid advancement of information technology, a totally new knowledge transfer model has been developed: Books and other forms of data (including text, voice and images) are digitized and then provided to readers by way of a more convenient method, in order to search for and obtain the exact content they need from libraries. We propose a concept for a Global Digital Library Grid. This digital library organization would not only include new members (new libraries or new museums) but be flexible enough not to affect the systems and framework of the original Grid member. As the organization grows, it will form an enormous Virtual Grid Digital Library to provide readers with speedy knowledge Service that meets their requirements.
In this paper, we propose a virtual aesthetic surgery (VAS) system using a deformation technique based on a radial basis function (RBF) and blending technique that combines the deformed facial component with the origi...
详细信息
暂无评论