Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | ACM Digital Library |
|---|---|
| Author | Orman, Levent V. |
| Copyright Year | 2013 |
| Abstract | Trust has emerged as a major impediment to the success of electronic markets and communities where interaction with the strangers is the norm. Social Networks and Online Communities enable interaction with complete strangers, and open up new commercial, political, and social possibilities. But those promises are rarely achieved because it is difficult to trust the online contacts. A common approach to remedy this problem is to compute trust values for the new contacts from the existing trust values in the network. There are two main methods: aggregation and transitivity. Yet, neither method provides satisfactory results because trust networks are sparse and transitivity may not hold. This article develops a Bayesian formulation of the problem, where trust is defined as a conditional probability, and a Bayesian Network analysis is employed to compute the unknown trust values in terms of the known trust values. The algorithms used to propagate conditional probabilities through the network are theoretically sound and based on a long-standing literature on probability propagation in Bayesian networks. Moreover, the context information that is typically ignored in trust literature is included here as a major factor in computing new trust values. These changes have led to significant improvements over existing approaches in the accuracy of computed trust, and with some modifications to the algorithm, in its reach. Real data acquired from Advogato network is used to do extensive testing, and the results confirm the practical value of a theoretically sound Bayesian approach. |
| Starting Page | 1 |
| Ending Page | 21 |
| Page Count | 21 |
| File Format | |
| ISSN | 2158656X |
| e-ISSN | 21586578 |
| DOI | 10.1145/2489790 |
| Volume Number | 4 |
| Issue Number | 2 |
| Journal | ACM Transactions on Management Information Systems (TMIS) |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2013-08-01 |
| Publisher Place | New York |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | Bayesian networks Social networks Trust inference Trust networks Trust propagation |
| Content Type | Text |
| Resource Type | Article |
| Subject | Management Information Systems Computer Science |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|