VIRTUAL COMMUNITY: The New Hope for E-Commerce
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 1
Abstract
A Virtual Community is a network which work within a social network of individual by any specific media and which have no limit about geographical area as well as political restriction. The Vital aim of virtual community is to achieve socialization i.e. a person may be share his feelings, his opinion and his knowledge without any boundaries. As we know that the most popular communities of exchange view, ideas and achieve socialization is virtual community which consist of various online communities. This Type of communities is used for a variety of social and professional group. From this communities were promoted as the business model in E-business or E-Commerce. This type of Communities is still perfect place to listen to customers. In this article author give a better knowledge about virtual communities and how it is useful for customer become the part of E- Commerce.
Authors and Affiliations
CHIRAG SOMANI
Keywords
Related Articles
- EP ID EP114129
- DOI -
- Views 125
- Downloads 0
Xilinx and Modelsim Habitat for Design of ECC Co-Processor Architecture
Xilinx is a most significant synthesizing tool for controller design in various engineering field specifically industrial engineering, instrumentation engineering, robotics, telecommunication, computer science engineerin...
A COMPATIVE STUDY OF SILENCE AND NON SILENCE REGIONS OF SPEECH SIGNAL USING PROSODY FEATURES FOR EMOTION RECOGNITION
The objective of this work is the comparative study of the speech signal between the silence and non- silence regions of the speech signal. In this work our main goal is to observe the pitch contour, energy and duration...
ACHIEVING MULTI-DOCUMENT SUMMARIZATION BASED ON MULTIPLE-RANKING METHODOLOGY WITH THE HELP OF NEAREST NEIGHBORS IN CLUSTERS
The goal of multi-document summarization is to give a prejudiced summary on a particular topic. This paper describes how to perform summarization task by means of multiple-ranking of sentences from various documents. Our...
A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST
Tree is a best data structure for data storage and retrieval of data whenever it could be accommodated in the memory. At the same time, this is true only when the tree is height-balanced and lesser depth from the root. I...
ANONYMIZATION BASED ON NESTED CLUSTERING FOR PRIVACY PRESERVATION IN DATA MINING
Privacy Preservation in data mining protects the data from revealing unauthorized extraction of information. Data Anonymization techniques implement this by modifying the data, so that the original values cannot be acqui...