Algorithm of Frequent Item Sets Mining Based on Index Table

2013 ◽  
Vol 373-375 ◽  
pp. 1076-1079
Author(s):  
Lin Zhang ◽  
Nan Zhen Yao ◽  
Jian Li Zhang
Keyword(s):  
Low Cost ◽  
Apriori Algorithm ◽  
Two Dimensional ◽  
One Dimensional ◽  
Single Index ◽  
Frequent Item ◽  
The One ◽  
Index Value ◽  
Frequent Item Sets ◽  
Index Table

The paper gave a new frequent item sets mining algorithm based on index table at multiple times for the Apriori algorithm scans the database which causes the I/O load is too large, and the costly problem with the Apriori algorithm which want to have a big candidate sets. The algorithm first generated a one-dimensional index table by scan the database once, and then generates a two-dimensional index table based on the one-dimensional index table. After the two-dimension index table had been generated, we can use the method similar with Floyd algorithm, which inserts the single index entry individually into the two-dimensional index table. If the count of new index value is greater than or equal to Minsuppor after the single index item had been inserted, the new index entrys Item will be a frequently item sets. After all single index entry had been inserted into the two-dimensional index table, all the index entry in the table will be the maximum frequently item sets. After analysis we can see that this algorithm has low cost and with the high accuracy than Apriori algorithm and can provide some reference for related rules.

Regions-based Two-dimensional Continua: The Euclidean Case

2018 ◽  
Author(s):  
Geoffrey Hellman ◽  
Stewart Shapiro
Keyword(s):  
Mathematical Induction ◽  
Dimensional Case ◽  
Two Dimensional ◽  
Entire Space ◽  
Euclidean Case ◽  
Free Basis ◽  
One Dimensional ◽  
Archimedean Property ◽  
The One

This chapter develops a Euclidean, two-dimensional, regions-based theory. As with the semi-Aristotelian account in Chapter 2, the goal here is to recover the now orthodox Dedekind–Cantor continuum on a point-free basis. The chapter derives the Archimedean property for a class of readily postulated orientations of certain special regions, what are called “generalized quadrilaterals” (intended as parallelograms), by which the entire space is covered. Then the chapter generalizes this to arbitrary orientations, and then establishes an isomorphism between the space and the usual point-based one. As in the one-dimensional case, this is done on the basis of axioms which contain no explicit “extremal clause”, and we have no axiom of induction other than ordinary numerical (mathematical) induction.

MUTUAL EXCLUSION ON OPTICAL BUSES

2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA
Keyword(s):  
Mutual Exclusion ◽  
Two Dimensional ◽  
One Dimensional ◽  
Dimensional Array ◽  
Propagation Delays ◽  
Optical Buses ◽  
The One

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.

scholarly journals DIFFERENTIAL EQUATION APPROACH FOR ONE- AND TWO-DIMENSIONAL LATTICE GREEN'S FUNCTION

2007 ◽  
Vol 21 (02n03) ◽  
pp. 139-154 ◽  
Author(s):  
J. H. ASAD
Keyword(s):  
Differential Equation ◽  
Green’S Function ◽  
Recurrence Relation ◽  
Green's Function ◽  
Two Dimensional ◽  
Dimensional Lattice ◽  
One Dimensional ◽  
The One ◽  
Lattice Green's Function ◽  
Lattice Green’S Function

A first-order differential equation of Green's function, at the origin G(0), for the one-dimensional lattice is derived by simple recurrence relation. Green's function at site (m) is then calculated in terms of G(0). A simple recurrence relation connecting the lattice Green's function at the site (m, n) and the first derivative of the lattice Green's function at the site (m ± 1, n) is presented for the two-dimensional lattice, a differential equation of second order in G(0, 0) is obtained. By making use of the latter recurrence relation, lattice Green's function at an arbitrary site is obtained in closed form. Finally, the phase shift and scattering cross-section are evaluated analytically and numerically for one- and two-impurities.

Substrate induced freezing, melting and depinning transitions in two-dimensional liquid crystalline systems

2022 ◽  
Author(s):  
Bharti bharti ◽  
Debabrata Deb
Keyword(s):  
Molecular Dynamics ◽  
Liquid Crystals ◽  
Molecular Dynamics Simulations ◽  
Liquid Crystalline ◽  
Two Dimensional ◽  
One Dimensional ◽  
The One ◽  
Dynamics Simulations

We use molecular dynamics simulations to investigate the ordering phenomena in two-dimensional (2D) liquid crystals over the one-dimensional periodic substrate (1DPS). We have used Gay-Berne (GB) potential to model the...

scholarly journals Water storage in wetted strips under irrigated coffee trees with different criteria of irrigation management

2013 ◽  
Vol 33 (2) ◽  
pp. 249-257 ◽  
Author(s):  
Alberto Colombo ◽  
Lívia A. Alvarenga ◽  
Myriane S. Scalco ◽  
Randal C. Ribeiro ◽  
Giselle F. Abreu
Keyword(s):  
Dimensional Analysis ◽  
Drip Irrigation ◽  
Irrigation Management ◽  
Water Storage ◽  
Moisture Distribution ◽  
Water Volume ◽  
Two Dimensional ◽  
One Dimensional ◽  
Irrigation Interval ◽  
The One

The increasing demand for water resources accentuates the need to reduce water waste through a more appropriate irrigation management. In the particular case of irrigated coffee planting, which in recent years presented growth with the predominance of drip irrigation, the improvement of drip irrigation management techniques is a necessity. The proper management of drip irrigation depends on the knowledge of the spatial pattern of soil moisture distribution inside the wetted strip formed under the irrigation lines. In this study, grids of 24 tensiometers were used to determine the water storage within the wetted strip formed under drippers, with a 3.78 L h-1 discharge, evenly spaced by 0.4 m, subjected to two different management criteria (fixed irrigation interval and 60 kPa tension). Estimates of storage based on a one-dimensional analysis, that only considers depth variations, were compared with two-dimensional estimates. The results indicate that for high-frequency irrigation the one-dimensional analysis is not appropriate. However, under less frequent irrigation, the two-dimensional analysis is dispensable, being the one-dimensional sufficient for calculating the water volume stored in the wetted strip.

APPLICATION OF A ONE-DIMENSIONAL POSITION SENSITIVE CHAMBER ON SYNCHROTRON RADIATION

2014 ◽  
Vol 27 ◽  
pp. 1460142
Author(s):  
HUIRONG QI ◽  
MEI LIU
Keyword(s):  
Synchrotron Radiation ◽  
Low Cost ◽  
Large Area ◽  
Position Resolution ◽  
One Dimensional ◽  
X Ray ◽  
High Position ◽  
Standard Data ◽  
Wire Chamber ◽  
The One

In the last few years, wire chambers have been frequently used for X-ray detection because of their low cost, large area and reliability. X-ray diffraction is an irreplaceable method for powder crystal lattice measurements. A one-dimensional single-wire chamber has been developed in our lab to provide high position resolution for powder diffraction experiments using synchrotron radiation. There are 200 readout strips of 0.5 mm width with a pitch of 1.0 mm in the X direction, and the working gas is a mixture of Ar and CO2 (90/10). The one-dimensional position of the original ionization point is determined by the adjacent strip's distribution information using the center of gravity method. Recently, a study of the detector's performance and diffraction image was completed at the 1W1B laboratory of the Beijing Synchrotron Radiation Facility (BSRF) using a sample of SiO2. Most of the relative errors between the measured values of diffraction angles and existing data were less than 1%. The best position resolution achieved for the detector in the test was 71 μm (σ value) with a 20 μm slit collimator. Finally, by changing the detector height in incremental distances from the center of the sample, the one-dimensional detector achieved a two-dimensional diffraction imaging function, and the results are in good agreement with standard data.

Computationally Efficient Model for 2D Ion Implantation Simulation

1997 ◽  
Vol 490 ◽  
Author(s):  
Misha Temkin ◽  
Ivan Chakarov
Keyword(s):  
Ion Implantation ◽  
Efficient Method ◽  
Two Dimensional ◽  
Computationally Efficient ◽  
Crystalline Materials ◽  
One Dimensional ◽  
The One

ABSTRACTA computationally efficient method for ion implantation simulation is presented. The method allows two-dimensional ion implantation profiles in arbitrary shaped structures to be calculated and is valid for both amorphous and crystalline materials. It uses an extension of the one-dimensional dual Pearson approximation into the second dimension.

The Research of Improved Apriori Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2179-2184 ◽  
Author(s):  
Zhen Yun Liao ◽  
Xiu Fen Fu ◽  
Ya Guang Wang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Frequent Item ◽  
Mining Algorithm ◽  
The Times ◽  
Frequent Item Sets ◽  
Candidate Item ◽  
Improved Algorithm

The first step of the association rule mining algorithm Apriori generate a lot of candidate item sets which are not frequent item sets, and all of these item sets cost a lot of system spending. To solve this problem，this paper presents an improved algorithm based on Apriori algorithm to improve the Apriori pruning step. Using this method, the large number of useless candidate item sets can be reduced effectively and it can also reduce the times of judge whether the item sets are frequent item sets. Experimental results show that the improved algorithm has better efficiency than classic Apriori algorithm.

A Graphical Exposition of the Ising Problem

1971 ◽  
Vol 12 (3) ◽  
pp. 365-377 ◽  
Author(s):  
Frank Harary
Keyword(s):  
Dimensional Case ◽  
Two Dimensional ◽  
One Dimensional ◽  
Higher Dimensional ◽  
The One

Ising [1] proposed the problem which now bears his name and solved it for the one-dimensional case only, leaving the higher dimensional cases as unsolved problems. The first solution to the two dimensional Ising problem was obtained by Onsager [6]. Onsager's method was subsequently explained more clearly by Kaufman [3]. More recently, Kac and Ward [2] discovered a simpler procedure involving determinants which is not logically complete.

Sign in / Sign up

Export Citation Format

Share Document