An overview of interval encoded temporal mining involving prioritized mining, fuzzy mining, and positive and negative rule mining
Journal Title: International Journal of Computer Science and Information Technologies - Year 2010, Vol 1, Issue 3
Abstract
Databases and data warehouses have become a vital part of many organizations. So useful information and helpful knowledge have to be mined from transactions. In real life, media information has time attributes either implicitly or explicitly called as temporal data. This paper focuses on an encoding method for the temporal database that reduces the memory utilization during processing. The first approach involves temporal mining applying the conventional algorithms like Apriori, AprioriTid and AprioriHybrid to an encoded temporal database that has a better performance than that when applied over a static database. The second approach involves weighted temporal mining over an encoded temporal database consisting of items which are prioritized by assigning weights. These weights are given according to the importance of the item from the user’s perspective. A fuzzy mining approach involving AprioriTid for weighted association rule mining gives better results than quantitative values. Also a method for positive and negative temporal mining extends traditional associations to include association rules of forms A=> ¬B, ¬A => ¬B, A=> ¬B, which indicate negative associations between itemsets. The experimental results are drawn from the complaints database of the telecommunication system which presents the most feasible temporal mining method with reduced time and computational complexities.
Authors and Affiliations
C. Balasubramanian , K. Duraiswamy , V. Palanisamy
Keywords
Related Articles
- EP ID EP97167
- DOI -
- Views 116
- Downloads 0
NETWORK STORAGE AND ITS FUTURE
In the IT world storage becomes a serious issue. Information storage systems are the bedrock on which a modern company rests. Data has to be available to whoever needs it, whenever they need it, from...
Four Walsh Transform Sectors Feature Vectors for Image Retrieval from Image Databases
The work of this paper presents the new idea of using Walsh transform to generate the feature vector for content based image retrieval. The complex Walsh transform is conceived by multiplying Sal functions...
Analysis of Data and Traffic Management during Privacy Preservation in Secure Multiparty Computation
-A protocol is secure if th e parties who want to compute their inputs hands it to the trusted parties. Trusted parties in turn compute th e inputs using the function f and give the re sult t o the respec tive parties...
An ARCHITECTURE MODEL for MANAGING TRANSACTIONS in DISCONNECTED MOBILE ENVIRONMENT
We present an architecture model for mobile transaction management for supporting disconnected computing. In this environment, Fixed Agents in the wired network cache the frequently accessed data from the server, which c...
Text database cleaning by filling the Missing values using Object Oriented Intelligent Multi-Agent System Data Cleaning Architecture
Agents are software programs that perform tasks on behalf of others and they are used to clean the text database with their characteristics. Agents are task oriented with the ability to learn by them...