Constrained Cube Lattices for Multidimensional Database Mining

Author(s):  
Alain Casali ◽  
Sébastien Nedjar ◽  
Rosine Cicchetti ◽  
Lotfi Lakhal

In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log­ical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addressing the discovery of constrained multidimensional patterns. In this chapter, the authors propose a foundation for various multidimensional database mining problems by introducing a new algebraic structure called cube lattice, which characterizes the search space to be explored. This chapter takes into consideration monotone and/or anti-monotone constraints enforced when mining multidimensional patterns. The authors propose condensed representations of the constrained cube lattice, which is a convex space, and present a generalized levelwise algorithm for computing them. Additionally, the authors consider the formalization of existing data cubes, and the discovery of frequent multidimensional patterns, while introducing a perfect concise representation from which any solution provided with its conjunction, disjunction and negation frequencies. Finally, emphasis on advantages of the cube lattice when compared to the power set lattice of binary attributes in multidimensional database mining are placed.

2010 ◽  
Vol 6 (3) ◽  
pp. 43-72 ◽  
Author(s):  
Alain Casali ◽  
Sébastien Nedjar ◽  
Rosine Cicchetti ◽  
Lotfi Lakhal

In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log­ical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addressing the discovery of constrained multidimen­sional patterns. In this paper, the authors propose a foundation for various multidimensional database mining problems by introducing a new algebraic struc­ture called cube lattice, which characterizes the search space to be explored. This paper takes into consideration monotone and/or anti-monotone constraints en­forced when mining multidimensional patterns. The authors propose condensed representations of the constrained cube lattice, which is a convex space, and present a generalized levelwise algorithm for computing them. Additionally, the authors consider the formalization of existing data cubes, and the discovery of frequent multidimensional patterns, while introducing a perfect concise representation from which any solution provided with its conjunction, disjunction and negation frequencies. Fi­nally, emphasis on advantages of the cube lattice when compared to the power set lattice of binary attributes in multidimensional database mining are placed.


2014 ◽  
Vol 23 (02) ◽  
pp. 1450001
Author(s):  
T. Hamrouni ◽  
S. Ben Yahia ◽  
E. Mephu Nguifo

In many real-life datasets, the number of extracted frequent patterns was shown to be huge, hampering the effective exploitation of such amount of knowledge by human experts. To overcome this limitation, exact condensed representations were introduced in order to offer a small-sized set of elements from which the faithful retrieval of all frequent patterns is possible. In this paper, we introduce a new exact condensed representation only based on particular elements from the disjunctive search space. In this space, a pattern is characterized by its disjunctive support, i.e., the frequency of complementary occurrences – instead of the ubiquitous co-occurrence link – of its items. For several benchmark datasets, this representation has been shown interesting in compactness terms compared to the pioneering approaches of the literature. In this respect, we mainly focus here on proposing an efficient tool for mining this representation. For this purpose, we introduce an algorithm, called DSSRM, dedicated to this task. We also propose several techniques to optimize its mining time as well as its memory consumption. The carried out empirical study on benchmark datasets shows that DSSRM is faster by several orders of magnitude than the MEP algorithm.


2018 ◽  
Vol 41 ◽  
Author(s):  
Benjamin C. Ruisch ◽  
Rajen A. Anderson ◽  
David A. Pizarro

AbstractWe argue that existing data on folk-economic beliefs (FEBs) present challenges to Boyer & Petersen's model. Specifically, the widespread individual variation in endorsement of FEBs casts doubt on the claim that humans are evolutionarily predisposed towards particular economic beliefs. Additionally, the authors' model cannot account for the systematic covariance between certain FEBs, such as those observed in distinct political ideologies.


1975 ◽  
Vol 26 ◽  
pp. 341-380 ◽  
Author(s):  
R. J. Anderle ◽  
M. C. Tanenbaum

AbstractObservations of artificial earth satellites provide a means of establishing an.origin, orientation, scale and control points for a coordinate system. Neither existing data nor future data are likely to provide significant information on the .001 angle between the axis of angular momentum and axis of rotation. Existing data have provided data to about .01 accuracy on the pole position and to possibly a meter on the origin of the system and for control points. The longitude origin is essentially arbitrary. While these accuracies permit acquisition of useful data on tides and polar motion through dynamio analyses, they are inadequate for determination of crustal motion or significant improvement in polar motion. The limitations arise from gravity, drag and radiation forces on the satellites as well as from instrument errors. Improvements in laser equipment and the launch of the dense LAGEOS satellite in an orbit high enough to suppress significant gravity and drag errors will permit determination of crustal motion and more accurate, higher frequency, polar motion. However, the reference frame for the results is likely to be an average reference frame defined by the observing stations, resulting in significant corrections to be determined for effects of changes in station configuration and data losses.


1988 ◽  
Vol 102 ◽  
pp. 107-110
Author(s):  
A. Burgess ◽  
H.E. Mason ◽  
J.A. Tully

AbstractA new way of critically assessing and compacting data for electron impact excitation of positive ions is proposed. This method allows one (i) to detect possible printing and computational errors in the published tables, (ii) to interpolate and extrapolate the existing data as a function of energy or temperature, and (iii) to simplify considerably the storage and transfer of data without significant loss of information. Theoretical or experimental collision strengths Ω(E) are scaled and then plotted as functions of the colliding electron energy, the entire range of which is conveniently mapped onto the interval (0,1). For a given transition the scaled Ω can be accurately represented - usually to within a fraction of a percent - by a 5 point least squares spline. Further details are given in (2). Similar techniques enable thermally averaged collision strengths upsilon (T) to be obtained at arbitrary temperatures in the interval 0 < T < ∞. Application of the method is possible by means of an interactive program with graphical display (2). To illustrate this practical procedure we use the program to treat Ω for the optically allowed transition 2s → 2p in ArXVI.


2009 ◽  
Vol 29 (S 01) ◽  
pp. S7-S12
Author(s):  
M. Spannagl ◽  
W. Schramm ◽  
H. Krebs ◽  

SummarySince 1978 an annual multicentric survey regarding the epidemiology of patients suffering of haemophilia is performed with support of haemophilia treating centres of any size. Again the actual compilation is resting upon a broad database returning to over 30 years of inquiry well representing both the actual and retrospective status of mortality. Prompted was exclusively information about patients with haemophilia A, B and von Willebrand disease. In particular anonymous data concerning the last 12 months about number of treated patients, type and severity of illness, HIV-status and detailed information about causes of death was inquired. This data was merged with existing data and analyzed statistically. In the 2007/2008 survey, a total


2013 ◽  
Vol 10 (1) ◽  
pp. 71-80 ◽  
Author(s):  
Lucile Gruntz ◽  
Delphine Pagès-El Karoui

Based on two ethnographical studies, our article explores social remittances from France and from the Gulf States, i.e. the way Egyptian migrants and returnees contribute to social change in their homeland with a focus on gender ideals and practices, as well as on the ways families cope with departure, absence and return. Policies in the home and host countries, public discourse, translocal networks, and individual locations within evolving structures of power, set the frame for an analysis of the consequences of migration in Egypt. This combination of structural factors is necessary to grasp the complex negotiations of family and gender norms, as asserted through idealized models, or enacted in daily practices in immigration and back home.


2015 ◽  
Vol 1 (4) ◽  
pp. 270
Author(s):  
Muhammad Syukri Mustafa ◽  
I. Wayan Simpen

Penelitian ini dimaksudkan untuk melakukan prediksi terhadap kemungkian mahasiswa baru dapat menyelesaikan studi tepat waktu dengan menggunakan analisis data mining untuk menggali tumpukan histori data dengan menggunakan algoritma K-Nearest Neighbor (KNN). Aplikasi yang dihasilkan pada penelitian ini akan menggunakan berbagai atribut yang klasifikasikan dalam suatu data mining antara lain nilai ujian nasional (UN), asal sekolah/ daerah, jenis kelamin, pekerjaan dan penghasilan orang tua, jumlah bersaudara, dan lain-lain sehingga dengan menerapkan analysis KNN dapat dilakukan suatu prediksi berdasarkan kedekatan histori data yang ada dengan data yang baru, apakah mahasiswa tersebut berpeluang untuk menyelesaikan studi tepat waktu atau tidak. Dari hasil pengujian dengan menerapkan algoritma KNN dan menggunakan data sampel alumni tahun wisuda 2004 s.d. 2010 untuk kasus lama dan data alumni tahun wisuda 2011 untuk kasus baru diperoleh tingkat akurasi sebesar 83,36%.This research is intended to predict the possibility of new students time to complete studies using data mining analysis to explore the history stack data using K-Nearest Neighbor algorithm (KNN). Applications generated in this study will use a variety of attributes in a data mining classified among other Ujian Nasional scores (UN), the origin of the school / area, gender, occupation and income of parents, number of siblings, and others that by applying the analysis KNN can do a prediction based on historical proximity of existing data with new data, whether the student is likely to complete the study on time or not. From the test results by applying the KNN algorithm and uses sample data alumnus graduation year 2004 s.d 2010 for the case of a long and alumni data graduation year 2011 for new cases obtained accuracy rate of 83.36%.


2019 ◽  
Vol 19 (2) ◽  
pp. 101-110
Author(s):  
Adrian Firdaus ◽  
M. Dwi Yoga Sutanto ◽  
Rajin Sihombing ◽  
M. Weldy Hermawan

Abstract Every port in Indonesia must have a Port Master Plan that contains an integrated port development plan. This study discusses one important aspect in the preparation of the Port Master Plan, namely the projected movement of goods and passengers, which can be used as a reference in determining the need for facilities at each stage of port development. The case study was conducted at a port located in a district in Maluku Province and aims to evaluate the analysis of projected demand for goods and passengers occurring at the port. The projection method used is time series and econometric projection. The projection results are then compared with the existing data in 2018. The results of this study show that the econometric projection gives adequate results in predicting loading and unloading activities as well as the number of passenger arrival and departure in 2018. This is indicated by the difference in the percentage of projection results towards the existing data, which is smaller than 10%. Whereas for loading and unloading activities, time series projections with logarithmic trends give better results than econometric projections. Keywords: port, port master plan, port development, unloading activities  Abstrak Setiap pelabuhan di Indonesia harus memiliki sebuah Rencana Induk Pelabuhan yang memuat rencana pengem-bangan pelabuhan secara terpadu. Studi ini membahas salah satu aspek penting dalam penyusunan Rencana Induk Pelabuhan, yaitu proyeksi pergerakan barang dan penumpang, yang dapat dipakai sebagai acuan dalam penentuan kebutuhan fasilitas di setiap tahap pengembangan pelabuhan. Studi kasus dilakukan pada sebuah pelabuhan yang terletak di sebuah kabupaten di Provinsi Maluku dan bertujuan untuk melakukan evaluasi ter-hadap analisis proyeksi demand barang dan penumpang yang terjadi di pelabuhan tersebut. Metode proyeksi yang dipakai adalah proyeksi deret waktu dan ekonometrik. Hasil proyeksi selanjutnya dibandingkan dengan data eksisting tahun 2018. Hasil studi ini menunjukkan bahwa proyeksi ekonometrik memberikan hasil yang cukup baik dalam memprediksi aktivitas bongkar barang serta jumlah penumpang naik dan turun di tahun 2018. Hal ini diindikasikan dengan selisih persentase hasil proyeksi terhadap data eksisting yang lebih kecil dari 10%. Sedangkan untuk aktivitas muat barang, proyeksi deret waktu dengan tren logaritmik memberikan hasil yang lebih baik daripada proyeksi ekonometrik. Kata-kata kunci: pelabuhan, rencana induk pelabuhan, pengembangan pelauhan, aktivitas bongkar barang


Sign in / Sign up

Export Citation Format

Share Document