Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.
Jurisprudential rules, a broad section to lower the legitimacy of the ruling on the developments of politics, which is increasing day by day, and developments of complex judicial issues, provided that the rule derived from the texts of the legitimate or verbal significance.
And the introduction of jurisprudence rules in the provisions concerning the legitimate policy, the first to take from the provisions of the situation; because the rules of jurisprudence is a summary of the provisions reached by the scholars of the nation after study and scrutiny, which is qualified and largely to cover the need of the owners of public mandates.
Since the law is the tool for implementing the state’s public policies, it is natural that its provisions (or at least some of them) seek to preserve human dignity as the source on which all rights and freedoms are based. One of the examples of humanizing the provisions of the law in France is what is known as the winter truce. What is this truce, what are the justifications for granting it, what is its historical origin, how did the legislative treatment of it develop, what are the similarities and differences between it and other legal periods included in French law, what is the scope of its application, and what are the effects resulting from it. These questions and others are what we will try to answer through this research.
The data preprocessing step is an important step in web usage mining because of the nature of log data, which are heterogeneous, unstructured, and noisy. Given the scalability and efficiency of algorithms in pattern discovery, a preprocessing step must be applied. In this study, the sequential methodologies utilized in the preprocessing of data from web server logs, with an emphasis on sub-phases, such as session identification, user identification, and data cleansing, are comprehensively evaluated and meticulously examined.
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2