Characterizing browsing strategies in the World-Wide Web
Proceedings of the Third International World-Wide Web conference on Technology, tools and applications
Parallel mining algorithms for generalized association rules with classification hierarchy
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Deriving concept hierarchies from text
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Fast Parallel Association Rule Mining without Candidacy Generation
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Mining Access Patterns Efficiently from Web Logs
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
OAI-P2P: A Peer-to-Peer Network for Open Archives
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Parallel Data Mining for Association Rules on Shared-Memory Multiprocessors
Parallel Data Mining for Association Rules on Shared-Memory Multiprocessors
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Frequent Pattern Mining on Message Passing Multiprocessor Systems
Distributed and Parallel Databases
FP-tax: tree structure based generalized association rule mining
Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
The LOCKSS peer-to-peer digital preservation system
ACM Transactions on Computer Systems (TOCS)
Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree
Data Mining and Knowledge Discovery
Indexing data-oriented overlay networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Mining Generalized Associations of Semantic Relations from Textual Web Content
IEEE Transactions on Knowledge and Data Engineering
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
HiSbase: histogram-based P2P main memory data management
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
TRIBLER: a social-based peer-to-peer system: Research Articles
Concurrency and Computation: Practice & Experience - Recent Advances in Peer-to-Peer Systems and Security (P2P 2006)
A Distributed Privacy-Preserving Association Rules Mining Scheme Using Frequent-Pattern Tree
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Pfp: parallel fp-growth for query recommendation
Proceedings of the 2008 ACM conference on Recommender systems
Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering
Design and development of a mobile peer-to-peer social networking application
Expert Systems with Applications: An International Journal
Automatic Extraction of Useful Facet Hierarchies from Text Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
PeerSoN: P2P social networking: early experiences and insights
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
A Privacy-Preserving Distributed Method for Mining Association Rules
AICI '09 Proceedings of the 2009 International Conference on Artificial Intelligence and Computational Intelligence - Volume 04
Parallel FP-growth on PC cluster
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Mining RDF metadata for generalized association rules
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Load balancing approach parallel algorithm for frequent pattern mining
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Mining Frequent Generalized Patterns for Web Personalization in the Presence of Taxonomies
International Journal of Data Warehousing and Mining
| Hi-index | 0.00 |
In contemporary internet architectures, including server farms and blog aggregators, web log data may be scattered among multiple cooperating peers. In order to perform content personalisation through provision of recommendations on such architectures, it is necessary to employ a recommendation algorithm; however, the majority of such algorithms are centralised, necessitating excessive data transfers and exhibiting performance issues when the number of users or the volume of data increase. In this paper, we propose an approach where the clickstream information is distributed to a number of peers, which cooperate for discovering frequent patterns and for generating recommendations, introducing: a) architectures that allow the distribution of both the content and the clickstream database to the participating peers; b) algorithms that allow collaborative decisions on the recommendations to the users, in the presence of scattered log information. The proposed approach may be employed in various domains, including digital libraries, social data, server farms and content distribution networks.