Web mining is the application of data mining techniques to extract knowledge from Web. Web mining has been explored to a vast degree and different techniques have been proposed for a variety of applications that includes Web Search, Classification and Personalization etc. The primary goal of the web site is to provide the relevant information to the users. Web mining technique is used to catego...

Background Family Planning (FP) program in Pakistan has been struggling to achieve the desired indicators. Despite a well-timed initiation of the program in late 50s, fertility decline has been sparingly slow. As a result, rapid population growth is impeding economic development in the country. A high population growth rate, the current fertility rate, a stagnant contraceptive prevalence rate a...

Mining high utility itemsets from a transactional database refers to the discovery of itemsets with high utility like profits. Frequent itemset mining (FIM) is one of the most fundamental problems in data mining. In this work, we propose a novel strategy based on the analysis of item co-occurrences to reduce the number of join operations that need to be performed (FHM: Faster High-Utility Miner...

The Frequent-Pattern-tree (FP-tree) is an efficient data structure for association-rule mining without the generation of candidate itemsets. It is used to compress a database into a tree structure, which stores only large items. When the underlying data is updated, the FP-tree, however, needs to process all the transactions in a batch way. In this paper, we thus attempt to extend the FP-tree co...

N-list is a novel data structure proposed in recent years. It has been proven to be very efficient for mining frequent itemsets. In this paper, we present PrePost + , a high-performance algorithm for mining frequent itemsets. It employs N-list to represent itemsets and directly discovers frequent itemsets using a set-enumeration search tree. Especially, it employs an efficient pruning strategy ...

Negative and positive association rule mining is extract needful information for large database. The generation of negative and positive rule based on interesting pattern and noninteresting pattern of database. The violation of given threshold value such as minimum support and minimum confidence generate some negative rules. The generation of association rule mining dependent some algorithm suc...

In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiple antenna systems employing spacetime codes, however, it is not clear what is the best way to obtain the soft-information required of the iterative scheme with low complexity. In this paper, we propose a modification of the Fincke-Poh...

The determination of the number of fungiform papillae (FP) on the human tongue is important for taste sensitivity studies. Most of the time, the counting of the FP is done manually. In this paper we propose a novel algorithm to count the FP using shape characteristics measured by cross-correlation. The accuracy of the algorithm is evaluated by counting the FP manually on the same images and the...

Let E1 and E2 be ordinary elliptic curves over a finite field Fp such that #E1(Fp) = #E2(Fp). Tate’s isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny. The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficie...