9427214
An Empirical Study of the Universal Chemical Key Algorithm for Assigning Unique Keys to Chemical Compounds
In this paper, we introduce an algorithm that assigns an essentially unique key called the Universal Chemical Key (UCK) to molecular structures. The molecular structures are represented as labeled graphs whose nodes abstract atoms and whose edges abstract bonds. The algorithm was tested on 236,917 compounds obtained from the National Cancer Institute (NCI) database of chemical compounds. On this database, the UCK algorithm assigned unique keys for chemicals with distinct molecular structures.
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.
6193650
Dealing with different distributions in learning from
In the problem of learning with positive and unlabeled examples, existing research all assumes that positive examples P and the hidden positive examples in the unlabeled set U are generated from the same distribution. This assumption may be violated in practice. In such cases, existing methods perform poorly. This paper proposes a novel technique A-EM to deal with the problem. Experimental results with product page classification demonstrate the effectiveness of the proposed technique.
61155076
Opinion Mining
Описанл процедуру формування інтегрального показника об’єкта згідно з відгуками користувачів під час застосування методів оцінювання опінії текстової інформації у web-документах. Запропоновано використання лінгвістичних змінних та застосування вагових коефіцієнтів для достовірнішого результату оцінювання емоційного забарвлення текстової інформації. Ключові слова: опінія, емоційне забарвлення, об’єкт, інтегральний показник, лінгвістична змінна, ваговий коефіцієнт.
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.
8786674
Entity discovery and assignment for opinion mining applications
Opinion mining became an important topic of study in recent years due to its wide range of applications. There are also many companies offering opinion mining services. One problem that has not been studied so far is the assignment of entities that have been talked about in each sentence. Let us use forum discussions about products as an example to make the problem concrete. In a typical discussion post, the author may give opinions on multiple products and also compare them. The issue is how to detect what products have been talked about in each sentence. If the sentence contains the product names, they need to be identified. We call this problem entity discovery. If the product names are not explicitly mentioned in the sentence but are implied due to the use of pronouns and language conventions, we need to infer the products. We call this problem entity assignment. These problems are important because without knowing what products each sentence talks about the opinion mined from the sentence is of little use. In this paper, we study these problems and propose two effective methods to solve the problems. Entity discovery is based on pattern discovery and entity assignment is based on mining of comparative sentences. Experimental results using a large number of forum posts demonstrate the effectiveness of the technique. Our system has also been successfully tested in a commercial setting.
13160546
A Population-Based Incremental Learning Algorithm with Elitist Strategy
The population-based incremental learning (PBIL) is a novel evolutionary algorithm combined the mechanisms of the Genetic Algorithm with competitive learning. In this paper, the influence of the number of selected best solutions on the convergence speed of the PBIL is studied by experiment. Based on experimental results, a PBIL algorithm with elitist strategy, named Double Learning PBIL (DLPBIL), is proposed. The new algorithm learns both the selected best solutions in current population and the optimal solution found so far in the algorithm at same time. Experimental results show that the DLPBIL out-performs the standard PBIL. Both the convergence speed and the solution quality are improved.
22060041
A Novel Fuzzy Neural Network with Fast Training and Accurate Generalization
For the reason of all parameters in a conventional fuzzy neural network (FNN) needed to be adjusted iteratively, learning can be very slow and may suffer from local minima. To overcome these problems, we propose a novel FNN in this paper, which shows a fast speed and accurate generalization. First we state the universal approximation theorem for an FNN with random membership function parameters (FNN-RM). Since all the membership function parameters are arbitrarily chosen, the proposed FNN-RM algorithm needs to adjust only the output weights of FNNs. Experimental results on function approximation and classification problems show that the new algorithm not only provides thousands of times of speed-up over traditional learning algorithms, but also produces better generalization performance in comparison to other FNNs.
6365125
Complex Analysis of Anisotropic Swarms with Gaussian Profiles
This paper considers an M-member "individual-based" continuous time swarm model with individuals moving with a nutrient profile (or an attractant/repellent) in an n- dimensional space. It is proved that the swarm members aggregate and eventually form a cohesive cluster of finite size for Gaussian Profiles. Moreover, all the swarm members will converge to more favorable areas of the Gaussian profile under certain conditions.
14599521
SyD: A Middleware Testbed for Collaborative Applications over Small Heterogeneous Devices and Data Stores
Developing a collaborative application running on a collection of heterogeneous, possibly mobile, devices, each potentially hosting data stores, using existing middleware technologies such as JXTA, BREW, compact .NET and J2ME requires too many ad-hoc techniques as well as cumbersome and time-consuming programming. Our System on Mobile Devices (SyD) middleware, on the other hand, has a modular architecture that makes such application development very systematic and streamlined. The architecture supports transactions over mobile data stores, with a range of remote group invocation options and embedded interdependencies among such data store objects. The architecture further provides a persistent uniform object view, group transaction with Quality of Service (QoS) specifications, and XML vocabulary for inter-device communication. This paper presents the basic SyD concepts and introduces the architecture and the design of the SyD middleware and its components. We also provide guidelines for SyD application development and deployment process. We include the basic performance figures of SyD components and a few SyD applications on Personal Digital Assistant (PDA) platforms. We believe that SyD is the first comprehensive working prototype of its kind, with a small code footprint of 112 KB with 76 KB being device-resident, and has a good potential for incorporating many ideas for performance extensions, scalability, QoS, workflows and security.
18339174
Robot Obstacle Avoidance based on an Improved Ant Colony Algorithm
Obstacle Avoidance for mobile robot is a nondeterministic polynomial hard (NP-hard) problem. Ant algorithm is the bionic algorithm which simulated ants foraging behavior, which can effectively solve the problems of this kind. In this paper, we propose an improved ant colony algorithm for robot obstacle avoidance, in which heuristic information is adjusted at run-time during the searching process. The proposed algorithm can effectively alleviate the local optimum problem, global optimal path can be robustly found in our experiments.