{"title":"SPAMINDEXING 2.0 : LES MOTEURS DE RECHERCHE FACE AUX DÉFIS DES IA GÉNÉRATIVES","authors":"Robert Viseur","doi":"10.36863/mds.a.25052","DOIUrl":"https://doi.org/10.36863/mds.a.25052","url":null,"abstract":"L’importance croissante des moteurs de recherche sur les performances commerciales des entreprises a conduit au développement de techniques permettant d'optimiser le référencement des sites web (SEO). À côté des techniques encouragées par les moteurs de recherche, plus éthiques, se sont développées des techniques dites « Black Hat SEO » (BH). Régulièrement soumises aux contre-mesures des moteurs de recherche tels que Google, ces techniques ont connu un renouveau avec le développement des outils en ligne d'automatisation de tâches et des IA génératives telles que ChatGPT. Dans cette recherche exploratoire, nous proposons, après avoir présenté les techniques classiques de référencement abusif (spamindexing), l’analyse des techniques promues par un réseau de gestionnaires de sites web et de comptes de réseaux sociaux. Ces techniques sont basées sur la transformation de contenus massivement collectés en ligne à l’aide d’outils no code ou par programmation. Elles posent des questions sur le plan de la propriété intellectuelle mais aussi sur les moyens de lutte des moteurs de recherche permettant de préserver la qualité de leur index, face à la prolifération de contenus générés massivement et automatiquement, sans pour autant handicaper le développement des pratiques légitimes.","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135401359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jean Babei, Martial Kadji, Max Amang a Ngon, Ralph Mbagnia
{"title":"IA ET SOUVERAINETÉ DES DONNÉES AGRICOLES EN AFRIQUE","authors":"Jean Babei, Martial Kadji, Max Amang a Ngon, Ralph Mbagnia","doi":"10.36863/mds.a.25431","DOIUrl":"https://doi.org/10.36863/mds.a.25431","url":null,"abstract":"Cet articule s’inscrit dans un processus d’éveil de conscience, notamment chez les agriculteurs africains, sur la nécessité d’envisager des mécanismes de protection de la souveraineté de leurs données. Deux études de cas réalisées au Cameroun sont proposées à l’appui d’interviews. Par le biais d’une approche qualitative, des analyses de contenu sont réalisées. Les résultats révèlent l’importance de la transparence dans la relation agriculteurs-entreprises de technologies de données. Ils proposent également la maîtrise collective des technologies et des infrastructures et le recours à la technologie blockchain entre autres.","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134883675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"LA DISTRIBUTION DIGITALISÉE À LA CROISÉE DES CHEMINS","authors":"Gilles Paché","doi":"10.36863/mds.a.25555","DOIUrl":"https://doi.org/10.36863/mds.a.25555","url":null,"abstract":"Si la distribution digitalisée retient de plus en plus l’attention, notamment dans le cadre de modèles innovants de livraison des commandes passées en ligne, la « face sombre » en demeure souvent ignorée. C’est notamment le cas du quick commerce, s’appuyant sur des travailleurs indépendants chargés d’assurer la gestion du dernier kilomètre pour permettre aux entreprises de remporter la bataille du délai. Au sein de collectifs de travail totalement éclatés, la protection sociale de ces travailleurs fait largement défaut, ce qui pose le problème des dimensions éthiques liées à la digitalisation de la distribution, et pas seulement le problème des difficultés opérationnelles à surmonter pour remporter la bataille du délai.","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134884009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"ÉTHIQUE DU DROPSHIPPING SEO À L’ÈRE DES IA GÉNÉRATIVES","authors":"Robert Viseur","doi":"10.36863/mds.a.25311","DOIUrl":"https://doi.org/10.36863/mds.a.25311","url":null,"abstract":"En marge des activités e-commerce traditionnelle ont émergé des techniques permettant de réduire les obstacles qui jalonnent le lancement d'un magasin en ligne. Parmi celles-ci, le dropshipping SEO a récemment su exploiter le potentiel d'automatisation qu'offrent les IA génératives. Cette recherche vise à explorer ces méthodes et à en examiner les implications éthiques.","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135058353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"REDEVABILITÉ, EXPLICABILITÉ ET TRANSPARENCE DE L’IA : UNE MISSION IMPOSSIBLE ?","authors":"SYLVIE GERBAIX","doi":"10.36863/mds.a.25083","DOIUrl":"https://doi.org/10.36863/mds.a.25083","url":null,"abstract":"Les systèmes algorithmiques d’intelligence artificielle produisent des effets ambivalents, appréciés ou critiqués mais qui peuvent également être indésirables, voire dangereux. Dès lors, apparaît l’idée qu’ils puissent rendre compte, autrement dit être redevable des effets et actions qu’ils causent. Ainsi, l’objectif est ici d’initier une réflexion sur cette “redevabilité” (accountability) des systèmes algorithmiques d’intelligence artificielle et les difficultés de sa mise en œuvre. En particulier, deux types d’obstacles sont mis en relief : la distanciation entre une myriade d’acteurs humains et non-humains et la complexité inhérente aux systèmes algorithmiques. Dès lors, les principes d’E. Morin pour penser cette complexité ouvrent des perspectives.","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135358307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Shengjie Lai , Isaac I. Bogoch , Nick W. Ruktanonchai , Alexander Watts , Xin Lu , Weizhong Yang , Hongjie Yu , Kamran Khan , Andrew J. Tatem
{"title":"Assessing spread risk of COVID-19 in early 2020","authors":"Shengjie Lai , Isaac I. Bogoch , Nick W. Ruktanonchai , Alexander Watts , Xin Lu , Weizhong Yang , Hongjie Yu , Kamran Khan , Andrew J. Tatem","doi":"10.1016/j.dsm.2022.08.004","DOIUrl":"10.1016/j.dsm.2022.08.004","url":null,"abstract":"<div><p>A novel coronavirus emerged in late 2019, named as the coronavirus disease 2019 (COVID-19) by the World Health Organization (WHO). This study was originally conducted in January 2020 to estimate the potential risk and geographic range of COVID-19 spread at the early stage of the transmission. A series of connectivity and risk analyses based on domestic and international travel networks were conducted using historical aggregated mobile phone data and air passenger itinerary data. We found that the cordon sanitaire of the primary city was likely to have occurred during the latter stages of peak population numbers leaving the city, with travellers departing into neighbouring cities and other megacities in China. We estimated that there were 59,912 international air passengers, of which 834 (95% uncertainty interval: 478–1,349) had COVID-19 infection, with a strong correlation seen between the predicted risks of importation and the number of imported cases found. Given the limited understanding of emerging infectious diseases in the very early stages of outbreaks, our approaches and findings in assessing travel patterns and risk of transmission can help guide public health preparedness and intervention design for new COVID-19 waves caused by variants of concern and future pandemics to effectively limit transmission beyond its initial extent.</p></div>","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"5 4","pages":"Pages 212-218"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666764922000340/pdfft?md5=a48e2e7bc12044a09382b68edcb847d2&pid=1-s2.0-S2666764922000340-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79326169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jingyang Liu , Shizhong Ai , Rong Du , Cathal M. Brugha
{"title":"Analysis of commodity traceability service effects on the purchase behavior of consumers using an evolutionary game model","authors":"Jingyang Liu , Shizhong Ai , Rong Du , Cathal M. Brugha","doi":"10.1016/j.dsm.2022.08.003","DOIUrl":"10.1016/j.dsm.2022.08.003","url":null,"abstract":"<div><p>Blockchain-based commodity traceability is an emerging technology developed in recent years; it plays a vital role in monitoring product quality and responding to product safety problems. Considering the perceived value of product traceability for consumers and the cost of using blockchain technology, determining whether merchants adopt blockchain-based commodity traceability technology deserves attention. Based on the information asymmetry between consumers and merchants, this paper establishes a two-party evolutionary game model to understand whether merchants enable the commodity traceability function and whether consumers choose to be involved in the commodity traceability relationship based on the Foote, Cone, and Belding grid theory. The model explores the influence boundary of merchants enabling the commodity traceability function for consumers with different degrees of involvement in purchasing behavior. The results show that traceability cost, consumer involvement, commodity price, and the value-added traceability nature of different commodities affect the evolution results. These results indicate that businesses need to constantly reduce the cost of traceability to improve consumer involvement and the perceived value of commodity traceability. Businesses must identify consumers with different involvement levels, and commodities with different traceability levels should provide targeted services for consumers and commodities.</p></div>","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"5 4","pages":"Pages 175-186"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666764922000339/pdfft?md5=1e2dbfeacadd651e244697ca88d31cc5&pid=1-s2.0-S2666764922000339-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74983402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effective arithmetic optimization algorithm with probabilistic search strategy for function optimization problems","authors":"Lu Peng , Chaohao Sun , Wenli Wu","doi":"10.1016/j.dsm.2022.08.002","DOIUrl":"10.1016/j.dsm.2022.08.002","url":null,"abstract":"<div><p>This paper proposes an enhanced arithmetic optimization algorithm (AOA) called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA. Furthermore, an adjustable parameter is also developed to balance the exploration and exploitation operations. In addition, a jump mechanism is included in the PSAOA to assist individuals in jumping out of local optima. Using 29 classical benchmark functions, the proposed PSAOA is extensively tested. Compared to the AOA and other well-known methods, the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.</p></div>","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"5 4","pages":"Pages 163-174"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666764922000315/pdfft?md5=4a4f5d81d0c4eab41e184daef9f1971f&pid=1-s2.0-S2666764922000315-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87639979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"China futures price forecasting based on online search and information transfer","authors":"Jingyi Liang, Guozhu Jia","doi":"10.1016/j.dsm.2022.09.002","DOIUrl":"10.1016/j.dsm.2022.09.002","url":null,"abstract":"<div><p>The synchronicity effect between the financial market and online response for time-series forecasting is an important task with wide applications. This study combines data from the Baidu index (BDI), Google trends (GT), and transfer entropy (TE) to forecast a wide range of futures prices with a focus on China. A forecasting model based on a hybrid gray wolf optimizer (GWO), convolutional neural network (CNN), and long short-term memory (LSTM) is developed. First, Baidu and Google dual-platform search data were selected and constructed as Internet-based consumer price index (ICPI) using principal component analysis. Second, TE is used to quantify the information between online behavior and futures markets. Finally, the effective Internet-based consumer price index (ICPI) and TE are introduced into the GWO-CNN-LSTM model to forecast the daily prices of corn, soybean, polyvinyl chloride (PVC), egg, and rebar futures. The results show that the GWO-CNN-LSTM model has a significant improvement in predicting future prices. Internet-based CPI built on Baidu and Google platforms has a high degree of real-time performance and reduces the platform and language bias of the search data. Our proposed framework can provide predictive decision support for government leaders, market investors, and production activities.</p></div>","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"5 4","pages":"Pages 187-198"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666764922000376/pdfft?md5=700142358e5a3516b1d3f96c23074de9&pid=1-s2.0-S2666764922000376-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80013768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Saeed Banaeian Far , Azadeh Imani Rad , Maryam Rajabzadeh Asaar
{"title":"ACR-MLM: a privacy-preserving framework for anonymous and confidential rewarding in blockchain-based multi-level marketing","authors":"Saeed Banaeian Far , Azadeh Imani Rad , Maryam Rajabzadeh Asaar","doi":"10.1016/j.dsm.2022.09.003","DOIUrl":"10.1016/j.dsm.2022.09.003","url":null,"abstract":"<div><p>Network marketing is a trading technique that provides companies with the opportunity to increase sales. With the increasing number of Internet-based purchases, several threats are increasingly observed in this field, such as user privacy violations, company owner (CO) fraud, the changing of sold products’ information, and the scalability of selling networks. This study presents the concept of a blockchain-based market called ACR-MLM that functions based on the multi-level marketing (MLM) model, through which registered users receive anonymous and confidential rewards for their own and their subgroups’ sales. Applying a public blockchain as the ACR-MLM framework’s infrastructure solves existing problems in MLM-based markets, such as CO fraud (against the government or its users), user privacy violations (obtaining their real names or subgroup users), and scalability (when vast numbers of users have been registered). To provide confidentiality and scalability to the ACR-MLM framework, hierarchical identity-based encryption (HIBE) was applied with a functional encryption (FE) scheme. Finally, the security of ACR-MLM is analyzed using the random oracle (RO) model and then evaluated.</p></div>","PeriodicalId":100353,"journal":{"name":"Data Science and Management","volume":"5 4","pages":"Pages 219-231"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666764922000388/pdfft?md5=446295a2eaf0eb9cec41954416bb906d&pid=1-s2.0-S2666764922000388-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77262685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}