Article Preview
Top1. Introduction
WWW sites have represented an accumulation of refined techniques known as Web 2.0. Social tagging is one of the critical peculiarities of Web 2.0. Social tagging systems allow users to use resources with free-form tags (Guandong, 2013). Tagging is a well known approach to translate web 2.0 websites. The tags are collected by the user’s favorites or interests in the social bookmarking website. In Social Bookmarking systems, Tagging can be taken as the demonstration of linking up of users, resources and tags (Sami, 2011). When a user employs a tag to a resource in the system, a multilateral relationship between the user, the resource and the tag is made. It helps user better way to understand and disseminate their collections of attractive objects (Gupta et.al 2010) (Figure 1).
Figure 1. Multilateral relationship
Feature Selection (FS) is a critical bit of knowledge discovery. It is a procedure which endeavors to choose characteristics which are more useful (Velayutham, 2011). FS is separated into the supervised and unsupervised categories. When class labels of the data are existing we use supervised feature selection, otherwise the unsupervised feature selection is applicable (Jothi, 2012). In this paper, the feature selection technique is applied for Bookmark Selection (BMS). The objective of Bookmark selection is to find out a marginal bookmarked URL subset from a Web 2.0 data while retaining a suitably high accuracy in representing the original bookmarks (Kumar, 2013; Inbarani et.al 2014b). The BMS is a must due to the profusion of noisy, irrelevant or misleading bookmarks added to web 2.0 sites. BMS is also used to increase the clustering accuracy and reduce the computational time of clustering algorithms. Web 2.0 user-generated tagged bookmark data usually contains some irrelevant bookmarks which should be removed before knowledge extraction. In this paper, Unsupervised Quick Reduct (USQR) method is utilized for selection of tagged bookmarks since there are no class labels for web 2.0 tagged bookmark data.
Clustering is one of the essential tasks in data mining. Clustering is considered as an intriguing methodology for finding similarities in data and putting similar data into groups (Selvakumar, 2013). Clustering partitions a dataset into several groups such that the similarity within a group is larger than that among groups (Hammouda, 2000). Tag clustering is the process of grouping similar tags into the same cluster and is important for the success of Social Systems. The objective of clustering tags has been to discover often utilized tags from the tagged bookmarks. On the tag clustering, similar tags are clustered based on tag weights associated with bookmarks (Kumar, 2013).
Firefly algorithm (FA) is a swarm-based algorithm that can be applied for solving optimization problems. In this paper, we concentrate on a clustering algorithm utilizing the Tolerance Rough sets concept that are consolidated into the original firefly algorithm to enhance the execution. We proposed a TRS-Firefly-K-Means clustering algorithm for social systems and the techniques are implemented and tested against a various social tagging dataset. The implementation of these techniques is compared based on ‘goodness of clustering’ evaluation measures.
The proposed work comprises of
- 1.
Information Extraction: Fetching information from social systems and the Data set are converted into matrix representation. “Delicious” (del.icio.us) is a famous social bookmarking web service for storing, sharing, and determining web bookmarks.
- 2.
Data Formatting: Data formatting comprises of mapping the tags and bookmarks focused around tag weights represented in matrix format.
- 3.
Bookmark selection: BMS is the progression of selecting more useful tagged bookmarks from a set of bookmarks associated with tags.
- 4.
Tag Clustering: to cluster relevant tags based on tag weights associated with selected bookmarks