14 citations · 17 across the 2 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2012★ 3 cited
An Efficient Algorithm for Mining Multilevel Association Rule Based on Pincer Search
Pratima Gautam, Rahul Shukla
Discovering frequent itemset is a key difficulty in significant data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. The…
cs.DB2010★ 14 cited
Significant Interval and Frequent Pattern Discovery in Web Log Data
Kanak Saxena, Rahul Shukla
There is a considerable body of work on sequence mining of Web Log Data. We are using One Pass frequent Episode discovery (or FED) algorithm, takes a different approach than the tr…