A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Pratap, M.
- Mining Popular Patterns from Multidimensional Database
Authors
1 Department of Electronics and Computer Engineering, School of Computing, K L University, Vaddeswaram, Guntur - 522502, Andhra Pradesh, IN
2 Department of Electronics and Computer Engineering, School of Computing, K L University, Vaddeswaram, Guntur - 522502, Andhra Pradesh
Source
Indian Journal of Science and Technology, Vol 9, No 17 (2016), Pagination:Abstract
Objectives: To extract popular patterns from multidimensional database. Design an efficient algorithm to find frequency and maximum transaction length of a pattern for mining popular patterns from multidimensional database. Analysis: Earlier to mine required patterns from database Apriori algorithm is used. After the frequent patterns, they have been extended to a many interesting patterns. However, to mine required patterns from a multidimensional database FP-growth algorithm have been extensively in use. Here we have implemented pop-growth technique to mine popular patterns from multidimensional database based on their popularity values. Findings: In this paper, we studied about popular patterns which give the popularity of each item or events in the entire database. Whereas Apriori and FP-growth algorithm depends upon the support or frequency measure of a itemset. Therefore, to obtain required patterns using these techniques one to mine FP-growth tree recursively this involves in more time consumption. In this paper, we have implemented a mining technique, which is prominent for multi-dimensional popular patterns. It overcomes the limitations of existing mining techniques. It implements lazy pruning technique and exhibits downward closure property. Improvement: Till date, mining of popular patterns based on their popularity measure is implemented only on transactional database and incremental database. But we have implemented this technique on a dynamic multidimensional database in which popular patterns can be mined in two dimensions. It involves in two steps: 1. The Pop-tree structure, which catches the vital information for the mining process of popular patterns. 2. The Pop-tree development calculates for mining popular patterns.Keywords
Down Ward Closure Property, Lazy Pruning, Multidimensional Database, Popular Patterns, Popularity, Support, Pop TreeFull Text
- Effect of Different Media Treatments on Rooting of Carnation (Dainathus cryophyllus L.) Cuttings of cv. BALTICO under Poly House Conditions
Authors
1 Department of Floriculture and Landscaping, College of Horticulture, Dr.Y.S.R. Horticultural University, Rajendranagar, Hyderabad (Telangana), IN
2 S.K.L. Telangana State Horticultural University, Rajendranagar, Hyderabad (Telangana), IN
Source
The Asian Journal of Horticulture, Vol 10, No 1 (2015), Pagination: 118-121Abstract
The present experiment was conducted to study the effect of media on ischolar_maining of carnation cuttings of cv. BALTICO under poly house conditions, during September, 2011 to March, 2012 and the experiment was conducted in Randomized Block Design. All the media treatments studied recorded superior ischolar_maining parameters over control. Among the media treatments studied red earth + coco peat recorded minimum number of days for ischolar_main initiation, maximum percentage of ischolar_maining, cumulative ischolar_main length, maximum fresh weight of ischolar_mains and percentage of establishment of ischolar_mained cuttings followed by coco peat + vermicompost and vermicompost alone. Media in combination recorded maximum ischolar_maining percentage, cumulative length of ischolar_mains and fresh weight of ischolar_mains over individual media treatments studied.
