Mining association rules using hash-index technique

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents the hash index table structure, a general and dense structure which provides web page set extraction from Log File of server. This hash table provides information about the original database. Since no constraint is enforced during the index creation phase, Web Page set mining (WPs-Mine) provides a complete representation of the original database. This approach works well for both sparse and dense data distributions. The proposed web page set index is linearly scalable for large data sets. Web page set mining supported by hash table index shows the performance always comparable with and often better than algorithms accessing data on flat files. Incremental update is feasible without re accessing the original transactional database. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Geeta, R. B., Mamillapalli, O., Totad, S. G., & Prasad Reddy, P. V. G. D. (2011). Mining association rules using hash-index technique. In Communications in Computer and Information Science (Vol. 205 CCIS, pp. 239–248). https://doi.org/10.1007/978-3-642-24055-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free