6493158
What's behind topic formation and development: a perspective of community core groups
Over the past several years, there has been a great interest in topic detection and tracking (TDT). Recently, analyzing general research trend from the huge amount of history documents also arouses considerable attention. However, existing work on TDT mainly focuses on overall trend analysis, and is unable to address questions such as "what determines the evolution of a topic?" and "when and how does a new topic get formed?".
 In this paper, we propose a core group model to explain the dynamics and further segment topic development. According to the division phase and interphase in the life cycle of a core group, a topic is separated into four states, i.e. birth state, extending state, saturation state and shrinkage state. Experimental results on a real dataset show that the division of a core group brings on the generation of a new topic, and the progress of an entire topic is closely correlated to the growth of a core group during its interphase.
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.
61155076
Opinion Mining
Описанл процедуру формування інтегрального показника об’єкта згідно з відгуками користувачів під час застосування методів оцінювання опінії текстової інформації у web-документах. Запропоновано використання лінгвістичних змінних та застосування вагових коефіцієнтів для достовірнішого результату оцінювання емоційного забарвлення текстової інформації. Ключові слова: опінія, емоційне забарвлення, об’єкт, інтегральний показник, лінгвістична змінна, ваговий коефіцієнт.
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.
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.
39858908
The dynamics of a prey-dependent consumption model concerning impulsive control strategy
A mathematical model for dynamics of a prey-dependent consumption model concerning impulsive control strategy is proposed and analyzed. We show that there exists a globally stable pest-eradication periodic solution when the impulsive period is less than some critical values. Further, the conditions for the permanence of system are given. We show the existence of nontrivial periodic solution if the pest-eradication periodic solution loses its stability. When the unique positive periodic solution lose its stability, numerical simulation shows there is a characteristic sequence of bifurcations, leading to a chaotic dynamics, which implies that the impulsive control model we considered has more complex dynamics including period-doubling bifurcation, symmetry-breaking bifurcation, period-halving bifurcation, quasi-periodic oscillation and chaos.
17391590
Complex Analysis of Anisotropic Swarms
This paper considers a continuous time swarm model with individuals moving with a nutrient profile (or an attractant/repellent) in an n-dimensional space. The swarm behavior is a result of a balance between inter-individual interplays as well as the interplays of the swarm agents with their environment. It is proved that the swarm members aggregate and eventually form a cohesive cluster of finite size around the swarm weighted center in a finite time under certain conditions.
32625268
An Energy-Minimizing Mesh Parameterization
In this paper, we propose a new energy-minimizing mesh parameterization method, which linearly combines two new energies EQ and EM. It not only avoids triangles overlap in the parameter domain, but also is invariant under rotation, translation and scale transformations. We first parameterize the original 3D mesh to the parameter plane by using the energy-minimizing parameterization, and get the optimal effect by optimizing the weights wij gradually. Experimental results indicate that this optimized energy-minimizing method has low distortion and good stability.
62547522
Reprogrammable gate arrays for hardware accelerated IC design verification
Abstract The paper discusses the development of a hardware accelerator environment for ASIC design verification. A reprogrammable gate array serves as a breadboard for the ASIC design. Design entry is accepted in schematic or VHDL description form. An IC test instrument is used to program the gate array and run realtime functional tests on the ASIC design. It is anticipated that significant reductions in the ASIC development cycle can be achieved with this system, as well as allowing for more rapid design space exploration. Hardware accelerated logic and fault simulation is also accommodated when the reprogrammable gate array is configured as either the faulty or fault-free logic block of interest
2862662
Distributed network self-management model based on CSCW
Computer network system has become a large-scale distributed system. But various kinds of existing network management solutions cannot manage it efficiently and network management is facing the new challenges. Applying the principles of CSCW to network management by multi-agent system is a novel train of thought of constructing the new generation network management system. Distributed network self-management model (DNSM), which is based on multi-agent system, adopts the management policies based on management domain and provides users with Web-based management way, was put forward in this paper. This model not only provides network management with more intelligence but also avoids the usage of amounts of network bandwidth. The experimental results show that DNSM is better than the existing network management solutions on performance for the large-scale computer network.