OLEMAR: An Online Environment for Mining Association Rules in Multidimensional Data

Data warehouses and OLAP (online analytical processing) provide tools to explore and navigate through data cubes in order to extract interesting information under different perspectives and levels of granularity. Nevertheless, OLAP techniques do not allow the identification of relationships, groupings, or exceptions that could hold in a data cube. To that end, we propose to enrich OLAP techniques with data mining facilities to benefit from the capabilities they offer. In this chapter, we propose an online environment for mining association rules in data cubes. Our environment called OLEMAR (online environment for mining association rules), is designed to extract associations from multidimensional data. It allows the extraction of inter-dimensional association rules from data cubes according to a sum-based aggregate measure, a more general indicator than aggregate values provided by the traditional COUNT measure. In our approach, OLAP users are able to drive a mining process guided by a meta-rule, which meets their analysis objectives. In addition, the environment is based on a formalization, which exploits aggregate measures to revisit the definition of the support and the confidence of discovered rules. This formalization also helps evaluate the interestingness of association rules according to two additional quality measures: lift and loevinger. Furthermore, in order to focus on the discovered associations and validate them, we provide a visual representation based on the graphic semiology principles. Such a representation consists in a graphic encoding of frequent patterns and association rules in the same multidimensional space as the one associated with the mined data cube. We have developed our approach as a component in a general online analysis platform called Miningcubes according to an Apriori-like algorithm, which helps extract inter-dimensional association rules directly from materialized multidimensional structures of data. In order to illustrate the effectiveness and the efficiency of our proposal, we analyze a real-life case study about breast cancer data and conduct performance experimentation of the mining process

An Improved Technique for Multi-Dimensional Constrained Gradient Mining

Multi-dimensional Constrained Gradient Mining, which is an aspect of data mining, is based on mining constrained frequent gradient pattern pairs with significant difference in their measures in transactional database. Top-k Fp-growth with Gradient Pruning and Top-k Fp-growth with No Gradient Pruning were the two algorithms used for Multi-dimensional Constrained Gradient Mining in previous studies. However, these algorithms have their shortcomings. The first requires construction of Fp-tree before searching through the database and the second algorithm requires searching of database twice in finding frequent pattern pairs. These cause the problems of using large amount of time and memory space, which retrogressively make mining of database cumbersome.  Based on this anomaly, a new algorithm that combines Top-k Fp-growth with Gradient pruning and Top-k Fp-growth with No Gradient pruning is designed to eliminate these drawbacks. The new algorithm called Top-K Fp-growth with support Gradient pruning (SUPGRAP) employs the method of scanning the database once, by searching for the node and all the descendant of the node of every task at each level. The idea is to form projected Multidimensional Database and then find the Multidimensional patterns within the projected databases. The evaluation of the new algorithm shows significant improvement in terms of time and space required over the existing algorithms.  &nbsp

Climatology of Mid-latitude Ionospheric Disturbances from the Very Large Array Low-frequency Sky Survey

The results of a climatological study of ionospheric disturbances derived from observations of cosmic sources from the Very Large Array (VLA) Low-frequency Sky Survey (VLSS) are presented. We have used the ionospheric corrections applied to the 74 MHz interferometric data within the VLSS imaging process to obtain fluctuation spectra for the total electron content (TEC) gradient on spatial scales from a few to hundreds of kilometers and temporal scales from less than one minute to nearly an hour. The observations sample nearly all times of day and all seasons. They also span latitudes and longitudes from 28 deg. N to 40 deg. N and 95 deg. W to 114 deg. W, respectively. We have binned and averaged the fluctuation spectra according to time of day, season, and geomagnetic (Kp index) and solar (F10.7) activity. These spectra provide a detailed, multi-scale account of seasonal and intraday variations in ionospheric activity with wavelike structures detected at wavelengths between about 35 and 250 km. In some cases, trends between spectral power and Kp index and/or F10.7 are also apparent. In addition, the VLSS observations allow for measurements of the turbulent power spectrum down to periods of 40 seconds (scales of ~0.4 km at the height of the E-region). While the level of turbulent activity does not appear to have a strong dependence on either Kp index or F10.7, it does appear to be more pronounced during the winter daytime, summer nighttime, and near dusk during the spring.Comment: accepted for publication in Radio Scienc

Deep learning for remote sensing image classification:A survey

Remote sensing (RS) image classification plays an important role in the earth observation technology using RS data, having been widely exploited in both military and civil fields. However, due to the characteristics of RS data such as high dimensionality and relatively small amounts of labeled samples available, performing RS image classification faces great scientific and practical challenges. In recent years, as new deep learning (DL) techniques emerge, approaches to RS image classification with DL have achieved significant breakthroughs, offering novel opportunities for the research and development of RS image classification. In this paper, a brief overview of typical DL models is presented first. This is followed by a systematic review of pixel?wise and scene?wise RS image classification approaches that are based on the use of DL. A comparative analysis regarding the performances of typical DL?based RS methods is also provided. Finally, the challenges and potential directions for further research are discussedpublishersversionPeer reviewe