Item set mining is a skill widely recycled in data mining for determining cherished correlations amongst data. The useful measure to extract the knowledge based on user interest is by means of frequency. This is the mostly used technique in order to get the data based on the user preferences and user request, so I have proposed frequent item set mining for searching key element, here mining top-k frequent closed item sets without minimum support should be more preferable than the traditional minimum support-based mining. The recital and suppleness for mining top-k frequent closed item sets, as well as mining top-k frequent closed item sets in data stream milieus and mining top-k frequent closed chronological or tight patterns. Mining top-k numerous closed item sets of Length no less than k value it will indiscriminately quarried. This paper introduces a novel calculation for mining complete continuous item sets. This calculation is alluded to as the TM (Transaction Mapping) calculation from here on. In this calculation, exchange ids of everything set are mapped and compacted to nonstop exchange interims in an alternate space and the numbering of item sets is performed by crossing these interim records in a profundity first request along the lexicographic tree. At the point, when the pressure coefficient winds up noticeably littler than the normal number of comparisons for interims crossing point at a specific level, the calculation changes to exchange and convergence. The calculation against two prominent continuous things set mining calculations, FPdevelopment, utilizing an assortment of informational indexes with short and long successive examples. Exploratory information demonstrates that the TM calculation outflanks these two calculations.
The failure rate of sensor nodes in Heterogeneous Wireless Sensor Networks is high due to the use of low battery-powered sensor nodes in a hostile environment. Networks of this kind become non-operational and turn into disjoint segmented networks due to large-scale failures of sensor nodes. This may require the placement of additional highpower relay nodes. In this paper, we propose a network partition recovery solution called Grey Wolf, which is an optimizer algorithm for repairing segmented heterogeneous wireless sensor networks. The proposed solution provides not only strong bi-connectivity in the damaged area, but also distributes traffic load among the multiple deployed nodes to enhance the repaired network’s lifetime. The experiment results show that the Grey Wolf algorithm offers a considerable performance advantage over other state-of-the-art approaches.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.