Andere Kunden interessierten sich auch für
![Data-Mining-Technik und Anwendungen]( "Data-Mining-Technik und Anwendungen")
Data-Mining-Technik und Anwendungen26,90 €![Dynamic Cryptography Technique using Random virtual 2D data tokens]( "Dynamic Cryptography Technique using Random virtual 2D data tokens")
Dynamic Cryptography Technique using Random virtual 2D data tokens26,99 €![Speed Control of DC Motor Using PWM Technique]( "Speed Control of DC Motor Using PWM Technique")
Speed Control of DC Motor Using PWM Technique32,99 €![DFIG-based wind turbine system using intelligent SVPWM technique]( "DFIG-based wind turbine system using intelligent SVPWM technique")
DFIG-based wind turbine system using intelligent SVPWM technique53,99 €![Near Surface Mounted Technique]( "Near Surface Mounted Technique")
Near Surface Mounted Technique32,99 €![Signal Correction Techniques for Biomedical Control Systems]( "Signal Correction Techniques for Biomedical Control Systems")
Signal Correction Techniques for Biomedical Control Systems50,99 €![Under Water Coral Reef Images 3D Reconstruction Technique]( "Under Water Coral Reef Images 3D Reconstruction Technique")
Under Water Coral Reef Images 3D Reconstruction Technique36,99 €
Mining high utility item sets from a transactional database refers to the discovery of item sets with high utility like profits. Although a number of relevant algorithms have been proposed in recent years, they incur the problem of producing a large number of candidate item sets for high utility item sets. Such a large number of candidate item sets degrades the mining performance in terms of execution time and space requirement. The situation may become worse when the database contains lots of long transactions or long high utility item sets.In this Book , we propose algorithm namely Improved mining algorithm (Utility Pattern Growth plus) for mining high utility item sets with a set of effective strategies for pruning candidate item sets. The information of high utility item sets is maintained in a tree-based data structure named UP-Tree (Utility Pattern Tree) such that candidate item sets can be generated efficiently with only two scans of database. The performance of UP-Growth and UP Growth+ is compared with the state-of-the-art algorithms on many types of both real and synthetic datasets.