Earticle

초록

영어

On-line communities on the Internet are highly self-organizing, dynamic and ubiquitous. The prime
interest of peers in this community is often sharing common interest, even when compromising privacy.
This paper presents a peer coordination strategy and a data sharing process for peers on the Internet
which allows them to discover their common interest in terms of sets of frequently visited URLs. To this
end, an algorithm was developed that allows the user to collect URLs of common interest from peers who
are currently visiting the same URLs as the user. Using the algorithm, sample data was collected by
randomly following links on popular websites to simulate the algorithm in operation. Experiments were
then performed to compare the number of discovered frequently visited URL sets and association rules
with the overhead induced by our network. An extended discussion on the experiments performed is
presented, by which the viability of the proposed model is demonstrated.

목차

Abstract
 1. Introduction
 2. Related work
 3. The data share model
  3.1. The coordination server
  3.2. Peer communication protocol
  3.3. Data share among peers by data mining
 4. Experiments
 4.1. Analysis of sample data
 5. Conclusion and future work
 6. References

저자

• Dennis Muhlestein [ Department of Computer Science, Utah State University ]
• SeungJin Lim [ Department of Computer Science, Utah State University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605