Online learning with social computing based interest sharing
Knowledge and Information SystemsPublished 10 November 2009
Dennis Muhlestein, SeungJin Lim
Citations16
SJR quartileQ2
SJR score0.83
SNIP1.37
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A model for peers on the Internet that allows them to discover their common interests in terms of sets of frequently visited URLs is presented, which assists online learning by automatically presenting users with URLs related to what they are currently browsing, thus saving users’ time searching for additional information and helping to educate them on the current topic.
Abstract
Communities on the Internet are highly self-organizing, dynamic, and ubiquitous. One objective of peers in such a community is sharing common interests, even when compromising privacy. This paper presents a model for peers on the Internet that allows them to discover their common interests in terms of sets of frequently visited URLs. This model assists online learning by automatically presenting users with URLs related to what they are currently browsing, thus saving users' time searching for additional information and helping to educate them on the current topic. To implement the model and collect test data, FireShare was developed as a plugin for the popular Web browser Firefox. Data was collected and analyzed on the number of discovered frequently visited URL sets, relevancy of mined association rules, and the overhead FireShare imposes on a network. While FireShare favorably validated the proposed model, analysis of the submitted test data shows high potential for success with future versions.
Keywords
Computer ScienceBusiness, Management and Accounting
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Program electronic library and information systemsAn algorithm for suffix stripping
8,136 Citations1980Martin Porter
An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL, and performs slightly better than a much more elaborate system with which it has been compared.
Communications of the ACMA vector space model for automatic indexing
7,434 Citations1975Gerard Salton, Anita M.-Y. Wong +1 more
An approach based on space density computations is used to choose an optimum indexing vocabulary for a collection of documents, demonstating the usefulness of the model.
Explaining collaborative filtering recommendations
1,698 Citations2000Jonathan L. Herlocker, Joseph A. Konstan +1 more
This paper presents experimental evidence that shows that providing explanations can improve the acceptance of ACF systems, and presents a model for explanations based on the user's conceptual model of the recommendation process.
IEEE Transactions on Knowledge and Data EngineeringParallel mining of association rules
1,069 Citations1996R. K. Agrawal, J.C. Shafer
This work considers the problem of mining association rules on a shared nothing multiprocessor and presents three algorithms that explore a spectrum of trade-offs between computation, communication, memory usage, synchronization, and the use of problem specific information.
Mining the most interesting rules
651 Citations1999Roberto J. Bayardo, Rakesh Agrawal
It is argued that by returning a broader set of rules than previous algorithms, these techniques allow for improved insight into the data and support more user-interaction in the optimized rule-mining process.
The complex dynamics of collaborative tagging
611 Citations2007Harry Halpin, Valentin Robu +1 more
A generative model of collaborative tagging is produced in order to understand the basic dynamics behind tagging, including how a power law distribution of tags could arise and how tag co-occurrence networks for a sample domain of tags can be used to analyze the meaning of particular tags given their relationship to other tags.
Efficient content location using interest-based locality in peer-to-peer systems
582 Citations2004Kunwadee Sripanidkulchai, Bruce M. Maggs +1 more
This work proposes a content location solution in which peers loosely organize themselves into an interest- based structure on top of the existing Gnutella network, and demonstrates the existence of interest-based locality in five diverse traces of content distribution applications, two of which are traces of popular peer-to-peer file-sharing applications.
Effective personalization based on association rule discovery from web usage data
432 Citations2001Bamshad Mobasher, Honghua Dai +2 more
This paper proposes effective and scalable techniques for Web personalization based on association rule discovery from usage data that can achieve better recommendation effectiveness, while maintaining a computational advantage over direct approaches to collaborative filtering such as the k-nearest-neighbor strategy.
User Modeling and User-Adapted InteractionWeb Usage Mining as a Tool for Personalization: A Survey
344 Citations2003Dimitrios Pierrakos, Γεώργιος Παλιούρας +2 more
This paper is a survey of recent work in the field of web usage mining for the benefit of research on the personalization of Web-based information services, focusing on the problems identified and the solutions that have been proposed.
eLearning based on the semantic web
259 Citations2001Ljiljana Stojanović, Steffen Staab +1 more
This paper presents an approach for implementing the eLearning scenario using Semantic Web technologies, primarily based on ontology-based descriptions of content, context and structure of the learning materials and benefits the providing of and accessing to theLearning materials.
Lecture notes in computer scienceIntegrating Web Usage and Content Mining for More Effective Personalization
258 Citations2000Bamshad Mobasher, Honghua Dai +3 more
This paper presents a framework for Web usage mining, distinguishing between the offine tasks of data preparation and mining, and the online process of customizing Web pages based on a user's active session, and describes effective techniques based on clustering to obtain a uniform representation for both site usage and site content profiles.
KnowledgeTree
254 Citations2004Peter Brusilovsky
The goal of KnowledgeTree is to bridge the gap between the currently popular approach to Web-based education, which is centered on learning management systems vs. the powerful but underused technologies in intelligent tutoring and adaptive hypermedia.
Communications of the ACMHow blogging software reshapes the online community
246 Citations2004Rebecca Blood
Spurred by easy-to-use commercial software, blogging is less about creating links and references to sites and sources, and increasingly about bloggers' own comments and personal interests.
IEEE Internet ComputingDistributed Data Mining in Peer-to-Peer Networks
219 Citations2006Souptik Datta, Kanishka Bhaduri +3 more
An overview of DDM applications and algorithms for P2P environments is offered, focusing particularly on local algorithms that perform data analysis by using computing primitives with limited communication overhead.
Can social bookmarking enhance search in the web?
192 Citations2007Yusuke Yanbe, Adam Jatowt +2 more
This paper proposes combining the widely used link-based ranking metric with the one derived using social bookmarking data, and shows the prototype system that implements the proposed approach and presents some preliminary results.
A Web page prediction model based on click-stream tree representation of user behavior
173 Citations2003Şule Gündüz Öğüdücü, M. TAMER ÖZSU
This work proposes a new model that considers both the order information of pages in a session and the time spent on them, and cluster user sessions based on their pair-wise similarity and represent the resulting clusters by a click-stream tree.
IEEE Internet ComputingInferring user interest
144 Citations2001Mark Claypool, David C. Brown +2 more
As the World Wide Web continues to grow, people find it impossible to access even a small portion of the information generated in a day from Usenet news, e-mail, and Web postings.
Frequent Pattern Mining in Web Log Data
122 Citations2006Renáta Iváncsy, István Vajk
Three pattern mining approaches are investigated from the Web usage mining point of view, which aim of discovering frequent patterns in Web log data to obtain information about the navigational behavior of the users.
Knowledge and Information SystemsA collaborative filtering framework based on fuzzy association rules and multiple-level similarity
114 Citations2006Cane Wing-ki Leung, Stephen Chan +1 more
Experimental results show that FARAMS improves prediction quality, as compared to similar approaches, and takes advantage of product similarities in taxonomies to address data sparseness and nontransitive associations.
Engineering Applications of Artificial IntelligenceDistributed data mining and agents
108 Citations2005Josenildo C. da Silva, Chris Giannella +3 more
A perspective on DDM algorithms in the context of multi-agents systems is offered and challenges for clustering in sensor-network environments, potential shortcomings of the current algorithms, and future work accordingly are described.
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Association Rule Mining in Peer-to-Peer Systems
93 Citations2004Ran Wolff, Assaf Schuster
Zenodo (CERN European Organization for Nuclear Research)User Context Aware Delivery of E-Learning Material: Approach and Architecture
81 Citations2020Andreas Schmidt, Claudia Winterhalter
This paper presents a general approach and architecture of modular learning objects and semantical metadata for their contextualization and shows that delivering of learning material, which is relevant to the current situation of the learner, is supported.
Engineering Applications of Artificial IntelligencePerformance optimization of gas turbine engine
65 Citations2005Valceres V.R. Silva, Wael Khatib +1 more
An evolutionary approach called the StudGA is presented as the optimization framework to design for optimal performance in terms of the three criteria above, which can potentially save on computing cost.
ACM SIGCOMM Computer Communication ReviewA case for associative peer to peer overlays
36 Citations2003Edith Cohen, Amos Fiat +1 more
The design exploits associations inherent in human selections to steer the search process to peers that are more likely to have an answer to the query, which is orders of magnitude more effective in locating rare items.
Association rule mining in peer-to-peer systems
35 Citations2004Ran Wolff, Assaf Schuster
This work presents an algorithm by which every node in the system can reach the exact solution, as if it were given the combined database, and is entirely asynchronous, imposes very little communication overhead, transparently tolerates network topology changes and node failures, and quickly adjusts to changes in the data as they occur.
Performance Analysis of a P2P-Based VoIP Software
33 Citations2006Lisha Gao, Luo Junzhou
The result indicates that the voice quality of Skype is no better than traditional VoIP software and the great benefit of P2P involved with VoIP is that it can solve NAT and firewall problems.
Data Mining and Knowledge DiscoveryCommunication-Efficient Distributed Mining of Association Rules
26 Citations2004Assaf Schuster, Ran Wolff
This paper presents a set of new algorithms that solve the Distributed Association Rule Mining problem using far less communication and are also extremely robust.
Knowledge and Information SystemsTowards personalised web intelligence
24 Citations2004Ah‐Hwee Tan, Hwee‐Leng Ong +3 more
The key challenges in personalised information management are outlined and a detailed account of FOCI’s underlying personalisation mechanism is given and a set of performance indices based on information entropy are proposed that measures the degree of matching between a system-generated cluster structure and a user-preferred category organisation.
Knowledge and Information SystemsOnline mining of frequent sets in data streams with error guarantee
20 Citations2007Xuan Hong Dang, Wee Keong Ng +1 more
This paper proposes an algorithm that allows online processing of streaming data and yet guaranteeing the support error of frequent patterns strictly within a user-specified threshold, and shows that it is an effective and reliable method for finding frequent sets in data stream environments when both constraints need to be satisfied.
Distributed approximate mining of frequent patterns
14 Citations2005Claudio Silvestri, Salvatore Orlando
This paper discusses a novel communication efficient distributed algorithm for approximate mining of frequent patterns from transactional databases that consists in the distributed exact computation of locally frequent itemsets and an effective method for inferring the local support of locally unfrequent itemsets.
Knowledge and Information SystemsMining user access patterns with traversal constraint for predicting web page requests
13 Citations2006Mei‐Ling Shyu, Choochart Haruechaiyasak +1 more
Creating a Java- and CORBA-Based Enterprise Knowledge Grid Using Topic Maps
12 Citations2003Axel Korthaus, Tobias Hildenbrand
This paper presents some basic considerations with respect to the design and implementation of an open standards-based enterprise Knowledge Grid architecture using Topic Maps, the “Topic Maps” system.
HKBU Institutional Repository (Hong Kong Baptist University)Mining Local Data Sources For Learning Global Cluster Models
5 Citations2004Chak-Man Lam, Xiaofeng Zhang +1 more
Experimental results show that the proposed distributed learning scheme is effective with accuracy close to the case with all the data physically shared for the learning.
A Common Interest Share Model for On-line Peer Communities
4 Citations2007Dennis Muhlestein, SeungJin Lim
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.
International Journal of Web Information SystemsA comparative study of web resource mining algorithms for one‐stop learning
2 Citations2006SeungJin Lim, Youngrae Ko
This paper presents three different scoring measures which can be plugged into an algorithm designed for the objective stated above and demonstrates the effectiveness of the algorithms proposed in this paper which are equipped with a choice of the three scoring measures.