@incollection{,
	
					
					
					FA3506EC5AA4DAB9714402A6676DF8CE
				,
	author={{Dr. SujathaDandu} and {B.L.Deekshatulu} and {PritiChandra} and {JNTU}},
	journal={{Global Journal of Computer Science and Technology}},
	journal={{GJCST}}0975-41720975-435010.34257/gjcst,
	address={Cambridge, United States},
	publisher={Global Journals Organisation}1321316
}

@book{b0,
	
	
		,
	title={{}}
		,
	author={{
			NItem-Support = N
		}}
		
	
	,
	note={Item-support + q.count; an entry N to the N Table}

}

@book{b1,
	
	
		,
	title={{Item-name = q i. item-name}}
		
	

}

@book{b2,
	
	
		,
	title={{Item-support = q}}
		,
	author={{
			N
		}}
		
	
	,
	note={count}

}

@book{b3,
	
	
		,
	title={{NTable)j.Item-support*minsup} 14}}
		,
	author={{
			=Fk
		}}
		
	
	,
	note={repeat 15. k = k + 1}

}

@book{b4,
	
	
		,
	title={{}}
		,
	author={{
			=Ct
		} and {
			Subset
		}}
		
		
			,
	address={Ck, t}
		
	

}

@book{b5,
	
	
		,
	title={{}}
		,
	author={{
			=Fk
		}}
		,
	editor={c.support *,-./012}}
		
	

}

@book{b6,
	
	
		,
	title={{Data Mining -Concepts and}}
		,
	editor={Techniques -Jia Wei Han and Micheline Kamber}
		
	

}

@book{b7,
	
	
		,
	title={{SPMF -A Sequential Pattern Mining Framework -Philippe Fournier-Viger}}
		
	

}

@book{b8,
	
	
		,
	title={{Contrasting Correlations by an Efficient Double-Clique Condition -Aixiang Li, Makoto Haraguchi, and Yoshiaki Okubo}}
		
	

}

@incollection{b9,
	
	
		,
	title={{Mining association rules between sets of items in large databases}}
		,
	author={{
			RAgrawal
		} and {
			TImielinski
		} and {
			ASwami
		}}
		
		
	
	
		,
	booktitle={{InProc.1993 ACM-SIGMOD Int. Conf. Management of Data}}
				Washington, D.C
		
			,
	year={May 1993}
			
		
	

}

@book{b10,
	
	
		,
	title={{Fast algorithms for mining association rules}}
		,
	author={{
			RAgrawal
		} and {
			RSrikant
		}}
		
		
			94
			
		
	

}

@book{b11,
	
	
		,
	title={{An effective hash-based algorithm for mining association rules}}
		,
	author={{
			JSPark
		} and {
			MSChen
		} and {
			PSYu
		}}
		
		
		
			,
	year={InSIGMOD1995}
			
		
	

}

@incollection{b12,
	
	
		,
	title={{An effective hash-based algorithm for mining association rules}}
		,
	author={{
			JSPark
		} and {
			MSChen
		} and {
			PSYu
		}}
		
		
	
	
		,
	booktitle={{Proceedings of ACM SIGMOD International Conference on Management of Data}}
				ACM SIGMOD International Conference on Management of DataSan Jose, CA
		
			,
	year={1995}
			
		
	

}

@incollection{b13,
	
	
		,
	title={{An efficient algorithm for mining association rules in large databases}}
		,
	author={{
			ESavasere
		} and {
			SOmiecinski
		} and {
			Navathe
		}}
		
		
	
	
		,
	booktitle={{Proceedings of the 21st International Conference on Very large Database}}
				the 21st International Conference on Very large Database
		
			,
	year={1995}
		
	

}

@incollection{b14,
	
	
		,
	title={{Mining Frequent Patterns without Candidate Generation (PDF), (Slides)}}
		,
	author={{
			JHan
		} and {
			JPei
		} and {
			YYin
		}}
		
		
	
	
		,
	booktitle={{Proc. 2000ACM-SIGMOD Int}}
				2000ACM-SIGMOD Int
		
			,
	year={May 2000}
		
	

}

@incollection{b15,
	
	
		,
	title={{A tree projection algorithm for generation of frequent itemsets}}
		,
	author={{
			AggarwalcAgarwalr
		} and {
			Prasadvvv
		}}
		
	
	
		,
	booktitle={{Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining}}
				
			,
	year={2000}
		
	

}

@incollection{b16,
	
	
		,
	title={{Hmine: Hyper-structure mining of frequent patterns in large databases}}
		,
	author={{
			JPei
		} and {
			JHan
		} and {
			HLu
		}}
		
		
	
	
		,
	booktitle={{ICDM}}
				
			,
	year={2001}
			
		
	

}