{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:33:54Z","timestamp":1761896034576,"version":"3.41.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T00:00:00Z","timestamp":1421971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2015,1,23]]},"abstract":"<jats:p>\n            In e-commerce environments, the trustworthiness of a seller is utterly important to potential buyers, especially when a seller is not known to them. Most existing trust evaluation models compute a single value to reflect the general trustworthiness of a seller without taking any transaction context information into account. With such a result as the indication of reputation, a buyer may be easily deceived by a malicious seller in a transaction where the notorious\n            <jats:italic>value imbalance<\/jats:italic>\n            problem is involved\u2014in other words, a malicious seller accumulates a high-level reputation by selling cheap products and then deceives buyers by inducing them to purchase more expensive products.\n          <\/jats:p>\n          <jats:p>\n            In this article, we first present a trust vector consisting of three values for contextual transaction trust (CTT). In the computation of CTT values, three identified important\n            <jats:italic>context dimensions<\/jats:italic>\n            , including Product Category, Transaction Amount, and Transaction Time, are taken into account. In the meantime, the computation of each CTT value is based on both past transactions and the forthcoming transaction. In particular, with different parameters specified by a buyer regarding context dimensions, different sets of CTT values can be calculated. As a result, all of these trust values can outline the reputation profile of a seller that indicates the dynamic trustworthiness of a seller in different products, product categories, price ranges, time periods, and any necessary combination of them. We name this new model\n            <jats:italic>ReputationPro<\/jats:italic>\n            . Nevertheless, in\n            <jats:italic>ReputationPro<\/jats:italic>\n            , the computation of reputation profile requires new data structures for appropriately indexing the precomputation of aggregates over large-scale ratings and transaction data in three context dimensions, as well as novel algorithms for promptly answering buyers\u2019 CTT queries. In addition, storing precomputed aggregation results consumes a large volume of space, particularly for a system with millions of sellers. Therefore, reducing storage space for aggregation results is also a great demand.\n          <\/jats:p>\n          <jats:p>\n            To solve these challenging problems, we first propose a new index scheme\n            <jats:italic>CMK-tree<\/jats:italic>\n            by extending the two-dimensional\n            <jats:italic>K-D-B-tree<\/jats:italic>\n            that indexes spatial data to support efficient computation of CTT values. Then, we further extend the\n            <jats:italic>CMK-tree<\/jats:italic>\n            and propose a\n            <jats:italic>CMK-tree<\/jats:italic>\n            <jats:sup>\n              <jats:italic>RS<\/jats:italic>\n            <\/jats:sup>\n            approach to reducing the storage space allocated to each seller. The two approaches are not only applicable to three context dimensions that are either linear or hierarchical but also take into account the characteristics of the transaction-time model\u2014that is, transaction data is inserted in chronological order. Moreover, the proposed data structures can index each specific product traded in a time period to compute the trustworthiness of a seller in selling a product. Finally, the experimental results illustrate that the\n            <jats:italic>CMK-tree<\/jats:italic>\n            is superior in efficiency of computing CTT values to all three existing approaches in the literature. In particular, while answering a buyer\u2019s CTT queries for each brand-based product category, the\n            <jats:italic>CMK-tree<\/jats:italic>\n            has almost linear query performance. In addition, with significantly reduced storage space, the\n            <jats:italic>CMK-tree<\/jats:italic>\n            <jats:sup>\n              <jats:italic>RS<\/jats:italic>\n            <\/jats:sup>\n            approach can further improve the efficiency in computing CTT values. Therefore, our proposed\n            <jats:italic>ReputationPro<\/jats:italic>\n            model is scalable to large-scale e-commerce Web sites in terms of efficiency and storage space consumption.\n          <\/jats:p>","DOI":"10.1145\/2697390","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T14:05:51Z","timestamp":1422453951000},"page":"1-49","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["ReputationPro"],"prefix":"10.1145","volume":"9","author":[{"given":"Haibin","family":"Zhang","sequence":"first","affiliation":[{"name":"Macquarie University, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[{"name":"Macquarie University, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuzhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ee-Peng","family":"Lim","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,1,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376712"},{"volume-title":"Proceedings of the IEEE International Conference on Intelligence and Security Informatics. 150--152","author":"Adali S.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.10.003"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2307\/4132332"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050028"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74949-3_16"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/248603.248616"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586138"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.09.036"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/648174.751131"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12459-4_3"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183463.1183470"},{"volume-title":"Proceedings of the International Conference on Database Theory. 143--157","author":"Govindarajan S.","key":"e_1_2_1_15_1"},{"volume-title":"Proceedings of the International Conference on Data Engineering. 152--159","author":"Gray J.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082473.1082548"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2011.129"},{"volume":"43","volume-title":"Proceedings of the International Conference on Engineering Applications of Neural Networks","author":"Ham F.","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233333"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2010.86"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488501000831"},{"volume-title":"Proceedings of the International Workshop on Security and Trust Management.","author":"J\u00f8sang A.","key":"e_1_2_1_23_1"},{"volume-title":"Proceedings of the Bled Electronic Commerce Conference. Article No. 41","author":"J\u00f8sang A.","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2005.05.019"},{"volume-title":"Proceedings of the Workshop on Database and Expert Systems Applications. 186--191","year":"1998","author":"Jurgens M.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775242"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2004.02.024"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1501434.1501460"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2007.07.001"},{"volume-title":"Proceedings of the IEEE International Conference on Autonomic and Trusted Computing. 122--138","author":"Li L.","key":"e_1_2_1_31_1"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/615204.615210"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-003-0093-x"},{"volume-title":"Proceedings of the International Conference on Trust Management. 48--62","author":"Liu J.","key":"e_1_2_1_34_1"},{"volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence. 1938--1944","author":"Liu X.","key":"e_1_2_1_35_1"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2012.123"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0138-1"},{"key":"e_1_2_1_38_1","unstructured":"S. P. Marsh. 1994. Formalising Trust as a Computational Concept. Ph.D. Dissertation. University of Stirling Stirling Scotland.  S. P. Marsh. 1994. Formalising Trust as a Computational Concept. Ph.D. Dissertation. University of Stirling Stirling Scotland."},{"key":"e_1_2_1_39_1","unstructured":"L. Mui. 2003. Computational Models of Trust and Reputation: Agents Evolutionary Games and Social Networks. Ph.D. Dissertation. Massachusetts Institute of Technology Cambridge MA.  L. Mui. 2003. Computational Models of Trust and Reputation: Agents Evolutionary Games and Social Networks. Ph.D. Dissertation. Massachusetts Institute of Technology Cambridge MA."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522980"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335219"},{"volume-title":"Proceedings of the International Symposium on Spatial and Temporal Databases. 443--459","author":"Papadias D.","key":"e_1_2_1_42_1"},{"volume-title":"Proceedings of the International Conference on Data Engineering. 166--175","author":"Papadias D.","key":"e_1_2_1_43_1"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/IAT.2006.107"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5211-x"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1080\/13600830600557935"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/375735.376110"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-004-0041-5"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501661"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 1513--1518","author":"Sierra C.","key":"e_1_2_1_51_1"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCEE.2009.77"},{"key":"e_1_2_1_53_1","unstructured":"G. Suryanarayana and R. N. Taylor. 2002. A Survey of Trust Management and Resource Discovery Technologies in Peer-to-Peer Applications. Technical Report. University of California Irvine.  G. Suryanarayana and R. N. Taylor. 2002. A Survey of Trust Management and Resource Discovery Technologies in Peer-to-Peer Applications. Technical Report. University of California Irvine."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1841909.1841914"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055709.1055713"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.93"},{"volume-title":"Proceedings of the Models of Trust for the Web Workshop.","author":"Toivonen S.","key":"e_1_2_1_57_1"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1363686.1364176"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2180861.2180863"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575771_30"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.5555\/2960717.2960731"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.56"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2010.39"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0241-5"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEBE.2008.12"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2008.84"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11761-008-0035-2"},{"volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence. 1551--1556","author":"Wang Y.","key":"e_1_2_1_68_1"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2005.104"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/EEE.2005.140"},{"key":"e_1_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Y. Wang and J. Vassileva. 2007. Toward Trust and Reputation Based Web Service Selection: A Survey. Technical Report. University of Saskatchewan Saskatoon.  Y. Wang and J. Vassileva. 2007. Toward Trust and Reputation Based Web Service Selection: A Survey. Technical Report. University of Saskatchewan Saskatoon.","DOI":"10.1109\/ICDCSW.2007.16"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779972"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1318566"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0107-z"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(02)00049-2"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375600"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543629"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366109"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2013.108"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2011.62"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2012.139"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/SOCA.2012.6449461"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.839"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2011.86"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180345.1180349"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2697390","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2697390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:11Z","timestamp":1750227131000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2697390"}},"subtitle":["The Efficient Approaches to Contextual Transaction Trust Computation in E-Commerce Environments"],"short-title":[],"issued":{"date-parts":[[2015,1,23]]},"references-count":85,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1,23]]}},"alternative-id":["10.1145\/2697390"],"URL":"https:\/\/doi.org\/10.1145\/2697390","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"type":"print","value":"1559-1131"},{"type":"electronic","value":"1559-114X"}],"subject":[],"published":{"date-parts":[[2015,1,23]]},"assertion":[{"value":"2013-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}