2182731
Speed-up iterative frequent itemset mining with constraint changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for this purpose. Recent work also highlighted the importance of using constraints to focus the mining process to mine only those relevant itemsets. In practice, data mining is often an interactive and iterative process. The user typically changes constraints and runs the mining algorithm many times before being satisfied with the final results. This interactive process is very time consuming. Existing mining algorithms are unable to take advantage of this iterative process to use previous mining results to speed up the current mining process. This results in an enormous waste of time and computation. In this paper, we propose an efficient technique to utilize previous mining results to improve the efficiency of current mining when constraints are changed. We first introduce the concept of tree boundary to summarize useful information available from previous mining. We then show that the tree boundary provides an effective and efficient framework for the new mining. The proposed technique has been implemented in the context of two existing frequent itemset mining algorithms, FP-tree and tree projection. Experiment results on both synthetic and real-life datasets show that the proposed approach achieves a dramatic saving of computation.
12241191
Finding Actionable Knowledge via Automated Comparison
The problem of finding interesting and actionable patterns is a major challenge in data mining. It has been studied by many data mining researchers. The issue is that data mining algorithms often generate too many patterns, which make it very hard for the user to find those truly useful ones. Over the years many techniques have been proposed. However, few have made it to real-life applications. At the end of 2005, we built a data mining system for Motorola (called Opportunity Map) to enable the user to explore the space of a large number of rules in order to find actionable knowledge. The approach is based on the concept of rule cubes and operations on rule cubes. A rule cube is similar to a data cube, but stores rules. Since its deployment, some issues have also been identified during the regular use of the system in Motorola. One of the key issues is that although the operations on rule cubes are flexible, each operation is primitive and has to be initiated by the user. Finding a piece of actionable knowledge typically involves many operations and intense visual inspections, which are labor-intensive and time-consuming. From interactions with our users, we identified a generic problem that is crucial for finding actionable knowledge. The problem involves extensive comparison of sub-populations and identification of the cause of their differences. This paper first defines the problem and then proposes an effective method to solve the problem automatically. To the best of our knowledge, there is no reported study of this problem. The new method has been added to the Opportunity Map system and is now in daily use in Motorola.
207156058
Editorial: special issue on web content mining
With the phenomenal growth of the Web, there is an everincreasing volume of data and information published in numerous Web pages. The research in Web mining aims to develop new techniques to effectively extract and mine useful knowledge or information from these Web pages [8]. Due to the heterogeneity and lack of structure of Web data, automated discovery of targeted or unexpected knowledge/information is a challenging task. It calls for novel methods that draw from a wide range of fields spanning data mining, machine learning, natural language processing, statistics, databases, and information retrieval. In the past few years, there was a rapid expansion of activities in the Web mining field, which consists of Web usage mining, Web structure mining, and Web content mining. Web usage mining refers to the discovery of user access patterns from Web usage logs. Web structure mining tries to discover useful knowledge from the structure of hyperlinks. Web content mining aims to extract/mine useful information or knowledge from Web page contents. For this special issue, we focus on Web content mining.
207576208
Clustering through decision tree construction
Clustering aims to find the intrinsic structure of data by organizing data objects into similarity groups or clusters. It is often called unsupervised learning as no class labels denoting an a priori partition of the objects are given. This is in contrast with supervised learning (e.g., classification) for which the data objects are already labeled with known classes. Past research in clustering has produced many algorithms. However, these algorithms have some major shortcomings. In this paper, we propose a novel clustering technique, which is based on a supervised learning technique called decision tree construction. The new technique is able to overcome many of these shortcomings. The key idea is to use a decision tree to partition the data space into cluster and empty (sparse) regions at different levels of details. The technique is able to find "natural" clusters in large high dimensional spaces eff iciently. It is suitable for clustering in the full dimensional space as well as in subspaces. It also provides comprehensible descriptions of clusters. Experiment results on both synthetic data and real-li fe data show that the technique is effective and also scales well for large high dimensional datasets.
11378825
Assigning Unique Keys to Chemical Compounds for Data Integration: Some Interesting Counter Examples
Integrating data involving chemical structures is simplified when unique identifiers (UIDs) can be associated with chemical structures. For example, these identifiers can be used as database keys. One common approach is to use the Unique SMILES notation introduced in [2]. The Unique SMILES views a chemical structure as a graph with atoms as nodes and bonds as edges and uses a depth first traversal of the graph to generate the SMILES strings. The algorithm establishes a node ordering by using certain symmetry properties of the graphs. In this paper, we present certain molecular graphs for which the algorithm fails to generate UIDs. Indeed, we show that different graphs in the same symmetry class employed by the Unique SMILES algorithm have different Unique SMILES IDs. We tested the algorithm on the National Cancer Institute (NCI) database [7] and found several molecular structures for which the algorithm also failed. We have also written a python script that generates molecular graphs for which the algorithm fails.
11669811
Multi-level organization and summarization of the discovered rules
Many existing data mining techniques often p roduce a large number of rules, which make it very difficult for manual inspection o f the rules to identify those interesting ones. This problem represents a major gap between the results of data mining and the understanding and use of the mining results. In this paper, we a rgue that t he key problem is not with the large number of rules because if there are indeed many rules that exist in data, they should b e discovered. The main p roblem is with ou r inability to organize, summarize and present the rules in such a way that they can b e ea sily analyzed b y the user. In this paper, we propose a technique to intuitively organize a nd summarize the discovered rules. With this organization, the discovered rules can b e presented to the user in the way as we think and talk about knowledge in ou r daily lives. This organization also allows the user to view the discovered rules at different levels of details, and to focus his/her attention on those interesting aspects. This paper presents this technique a nd u ses it t o o rganize, summarize a nd present t he knowledge e mbedded in a decision tree, and a set of association rules. Experiment results and p ractical applications show that the technique is both intuitive and effective.
206597617
Binary Tree Support Vector Machine Based on Kernel Fisher Discriminant for Multi-classification
In order to improve the accuracy of the conventional algorithms for multi-classifications, we propose a binary tree support vector machine based on Kernel Fisher Discriminant in this paper. To examine the training accuracy and the generalization performance of the proposed algorithm, One-against-All, One-against-One and the proposed algorithms are applied to five UCI data sets. The experimental results show that in general, the training and the testing accuracy of the proposed algorithm is the best one, and there exist no unclassifiable regions in the proposed algorithm.
12104280
Classification using support vector machines with graded resolution
A method which we call support vector machine with graded resolution (SVM-GR) is proposed in this paper. During the training of the SVM-GR, we first form data granules to train the SVM-GR and remove those data granules that are not support vectors. We then use the remaining training samples to train the SVM-GR. Compared with the traditional SVM, our SVM-GR algorithm requires fewer training samples and support vectors, hence the computational time and memory requirements for the SVM-GR are much smaller than those of a conventional SVM that use the entire dataset. Experiments on benchmark data sets show that the generalization performance of the SVM-GR is comparable to the traditional SVM.
11706749
A Graph-Based Algorithm for Mining Maximal Frequent Itemsets
Association rule mining is an important research branch of data mining, and computing frequent itemsets is the main problem. The paper is designed to find maximal frequent itemsets only. It presents an algorithm based on a frequent pattern graph, which can find maximal frequent itemsets quickly. A breadth-first-search and a depth-first-search techniques are used to produce all maximal frequent itemsets of a database. The paper also analyzes the complexity of the algorithm, and explains the computation procedure by examples. It has high time efficiency and less space complexity for computing maximal frequent itemsets.
7558736
An Adaptive Schedule Medium Access Control for Wireless Sensor Networks
Many media access control (MAC) protocols for wireless sensor networks (WSNs) such as sensor MAC (S-MAC) and carrier sense multiple access with minimum preamble sampling (CSMA-MPS) exploit listen/sleep cycles to conserve energy. The cycles of nodes influence the network performances such as energy efficiency, packet latency and throughput in WSNs. In this paper, an adaptive schedule medium access control (AS-MAC) for WSNs is presented. AS-MAC introduces the adaptation of the cycles in MAC layer to the data traffic. The effect of the protocol is that it can decrease the latency, improve the throughput and energy efficiency when traffic is dynamic. We also compare AS-MAC with S-MAC and CSMA-MPS through simulations and the results show it has better performances than the former protocols.
32186791
A singular integral of the composite operator
We establish the Poincare-type inequalities for the composition of the homotopy operator and the projection operator. We also obtain some estimates for the integral of the composite operator with a singular density.