5573305
V-Miner: using enhanced parallel coordinates to mine product design and test data
Analyzing data to find trends, correlations, and stable patterns is an important task in many industrial applications. This paper proposes a new technique based on parallel coordinate visualization. Previous work on parallel coordinate methods has shown that they are effective only when variables that are correlated and/or show similar patterns are displayed adjacently. Although current parallel coordinate tools allow the user to manually rearrange the order of variables, this process is very time-consuming when the number of variables is large. Automated assistance is required. This paper introduces an edit-distance based technique to rearrange variables so that interesting change patterns can be easily detected visually. The Visual Miner (V-Miner) software includes both automated methods for visualizing common patterns and a query tool that enables the user to describe specific target patterns to be mined or displayed by the system. In addition, the system can filter data according to rules sets imported from other data mining tools. This feature was found very helpful in practice, because it enables decision makers to visually identify interesting rules and data segments for further analysis or data mining. This paper begins with an introduction to the proposed techniques and the V-Miner system. Next, a case study illustrates how V-Miner has been used at Motorola to guide product design and test decisions.
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.
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.
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.
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.
9933281
A Learning Process Using SVMs for Multi-agents Decision Classification
In order to resolve decision classification problem in multiple agents system, this paper first introduces the architecture of multiple agents system. It then proposes a support vector machines based assessment approach, which has the ability to learn the rules form previous assessment results from domain experts. Finally, the experiment are conducted on the artificially dataset to illustrate how the proposed works, and the results show the proposed method has effective learning ability for decision classification problems.
11674952
The Design of the GPS-Based Surveying Robot Automatic Monitoring System for Underground Mining Safety
Earth subsidence in underground mining is an unavoidable problem in mining production, and timely and scientific observation and early warning is one of the important factors in the security of mining production. Though the surveying robot (i.e. automatic electronic total station) can automatically (or semi-automatically) monitor ground deformation for underground mining, the stability of the station location (monitor base station) has great impact on the monitor precision and when the measurement vision is covered, the surveying robot fails to monitor the corresponding deformation point. In order to tackle the above problem, the author and the research team have integrated the technology of GPS (Global Positioning System) with surveying robot and developed the GPS-based surveying robot automatic monitoring system for underground mining safety, which completely solves the foresaid problem, simplifies the monitor program and reduces the fixed investment cost of monitor. The article introduces the structure and working principle of the GPS-based surveying robot automatic monitoring system for underground mining safety, presents examples of monitor.
36269081
Semi-Data-Aided Nonlinear Carrier Recovery for BPSK Burst-Mode Transmissions
This paper focuses on carrier frequency recovery for BPSK burst transmissions over AWGN channel. Semi-data- aided (SDA) nonlinear frequency estimation algorithms based on maximum-likelihood (ML) principle are derived. According to the algorithms, fewer pilot symbols and some unknown data symbols can be used together for frequency estimation in order that both estimation accuracy and spectral efficiency can be satisfied simultaneously. Simulations are employed to assess the performance of the algorithms. The corresponding Cramer-Rao bounds are discussed. The theoretical analysis of the threshold effect of one estimator is also presented and compared with simulation results.
42464493
Designing Neural Networks Using Hybrid Particle Swarm Optimization
Evolving artificial neural network is an important issue in both evolutionary computation (EC) and neural networks (NN) fields. In this paper, a hybrid particle swarm optimization (PSO) is proposed by incorporating differential evolution (DE) and chaos into the classic PSO. By combining DE operation with PSO, the exploration and exploitation abilities can be well balanced, and the diversity of swarms can be reasonably maintained. Moreover, by hybridizing chaotic local search (CLS), DE operator and PSO operator, searching behavior can be enriched and the ability to avoid being trapped in local optima can be well enhanced. Then, the proposed hybrid PSO (named CPSODE) is applied to design multi-layer feed-forward neural network. Simulation results and comparisons demonstrate the effectiveness and efficiency of the proposed hybrid PSO.
8185718
ASG Automated Signature Generation for Worm-Like P2P Traffic Patterns
Many P2P software have the similar communication patterns with computer worms, thus they will bring in false positives for behaviour based worm detection. Up to now, little work is done on the research of the similarities between communication patterns of worm and P2P software as well as how to eliminate the worm-like P2P traffic. Based on the analysis of popular P2P software used nowadays and the host process information, this paper presents ASG, which is a novel host based algorithm to generate signatures for worm-like P2P communication patterns. The contribution of our work lies in three aspects: a) Analyzing communication pattern similarities between P2P traffic and worm traffic through examples. b) Designing one practical and simple signature format for worm-like P2P traffic based on the host process information, c) Presenting automated signature generation (ASG) method to extract the signature of worm-like P2P traffic. Experiments with the popular used P2P software show that ASG can effectively extract the signature and reduce the false positives.