Pub Date : 2022-06-20DOI: 10.1108/dta-10-2021-0296
L. Singh, R. Janghel, S. Sahu
PurposeAutomated skin lesion analysis plays a vital role in early detection. Having relatively small-sized imbalanced skin lesion datasets impedes learning and dominates research in automated skin lesion analysis. The unavailability of adequate data poses difficulty in developing classification methods due to the skewed class distribution.Design/methodology/approachBoosting-based transfer learning (TL) paradigms like Transfer AdaBoost algorithm can compensate for such a lack of samples by taking advantage of auxiliary data. However, in such methods, beneficial source instances representing the target have a fast and stochastic weight convergence, which results in “weight-drift” that negates transfer. In this paper, a framework is designed utilizing the “Rare-Transfer” (RT), a boosting-based TL algorithm, that prevents “weight-drift” and simultaneously addresses absolute-rarity in skin lesion datasets. RT prevents the weights of source samples from quick convergence. It addresses absolute-rarity using an instance transfer approach incorporating the best-fit set of auxiliary examples, which improves balanced error minimization. It compensates for class unbalance and scarcity of training samples in absolute-rarity simultaneously for inducing balanced error optimization.FindingsPromising results are obtained utilizing the RT compared with state-of-the-art techniques on absolute-rare skin lesion datasets with an accuracy of 92.5%. Wilcoxon signed-rank test examines significant differences amid the proposed RT algorithm and conventional algorithms used in the experiment.Originality/valueExperimentation is performed on absolute-rare four skin lesion datasets, and the effectiveness of RT is assessed based on accuracy, sensitivity, specificity and area under curve. The performance is compared with an existing ensemble and boosting-based TL methods.
{"title":"A boosting-based transfer learning method to address absolute-rarity in skin lesion datasets and prevent weight-drift for melanoma detection","authors":"L. Singh, R. Janghel, S. Sahu","doi":"10.1108/dta-10-2021-0296","DOIUrl":"https://doi.org/10.1108/dta-10-2021-0296","url":null,"abstract":"PurposeAutomated skin lesion analysis plays a vital role in early detection. Having relatively small-sized imbalanced skin lesion datasets impedes learning and dominates research in automated skin lesion analysis. The unavailability of adequate data poses difficulty in developing classification methods due to the skewed class distribution.Design/methodology/approachBoosting-based transfer learning (TL) paradigms like Transfer AdaBoost algorithm can compensate for such a lack of samples by taking advantage of auxiliary data. However, in such methods, beneficial source instances representing the target have a fast and stochastic weight convergence, which results in “weight-drift” that negates transfer. In this paper, a framework is designed utilizing the “Rare-Transfer” (RT), a boosting-based TL algorithm, that prevents “weight-drift” and simultaneously addresses absolute-rarity in skin lesion datasets. RT prevents the weights of source samples from quick convergence. It addresses absolute-rarity using an instance transfer approach incorporating the best-fit set of auxiliary examples, which improves balanced error minimization. It compensates for class unbalance and scarcity of training samples in absolute-rarity simultaneously for inducing balanced error optimization.FindingsPromising results are obtained utilizing the RT compared with state-of-the-art techniques on absolute-rare skin lesion datasets with an accuracy of 92.5%. Wilcoxon signed-rank test examines significant differences amid the proposed RT algorithm and conventional algorithms used in the experiment.Originality/valueExperimentation is performed on absolute-rare four skin lesion datasets, and the effectiveness of RT is assessed based on accuracy, sensitivity, specificity and area under curve. The performance is compared with an existing ensemble and boosting-based TL methods.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75255945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-03DOI: 10.1108/dta-12-2021-0389
Xiyue Deng, Xiaoming Li, Zhenzhen Chen, Meng Zhu, N. Xiong, Li Shen
PurposeHuman group behavior is the driving force behind many complex social and economic phenomena. Few studies have integrated multi-dimensional travel patterns and city interest points to construct urban security risk indicators. This paper combines traffic data and urban alarm data to analyze the safe travel characteristics of the urban population. The research results are helpful to explore the diversity of human group behavior, grasp the temporal and spatial laws and reveal regional security risks. It provides a reference for optimizing resource deployment and group intelligence analysis in emergency management.Design/methodology/approachBased on the dynamics index of group behavior, this paper mines the data of large shared bikes and ride-hailing in a big city of China. We integrate the urban interest points and travel dynamic characteristics, construct the urban traffic safety index based on alarm behavior and further calculate the urban safety index.FindingsThis study found significant differences in the travel power index among ride-sharing users. There is a positive correlation between user shared bike trips and the power-law bimodal phenomenon in the logarithmic coordinate system. It is closely related to the urban public security index.Originality/valueBased on group-shared dynamic index integrated alarm, we innovatively constructed an urban public safety index and analyzed the correlation of travel alarm behavior. The research results fully reveal the internal mechanism of the group behavior safety index and provide a valuable supplement for the police intelligence analysis.
{"title":"Construction of public security indicators based on characteristics of shared group behavior patterns","authors":"Xiyue Deng, Xiaoming Li, Zhenzhen Chen, Meng Zhu, N. Xiong, Li Shen","doi":"10.1108/dta-12-2021-0389","DOIUrl":"https://doi.org/10.1108/dta-12-2021-0389","url":null,"abstract":"PurposeHuman group behavior is the driving force behind many complex social and economic phenomena. Few studies have integrated multi-dimensional travel patterns and city interest points to construct urban security risk indicators. This paper combines traffic data and urban alarm data to analyze the safe travel characteristics of the urban population. The research results are helpful to explore the diversity of human group behavior, grasp the temporal and spatial laws and reveal regional security risks. It provides a reference for optimizing resource deployment and group intelligence analysis in emergency management.Design/methodology/approachBased on the dynamics index of group behavior, this paper mines the data of large shared bikes and ride-hailing in a big city of China. We integrate the urban interest points and travel dynamic characteristics, construct the urban traffic safety index based on alarm behavior and further calculate the urban safety index.FindingsThis study found significant differences in the travel power index among ride-sharing users. There is a positive correlation between user shared bike trips and the power-law bimodal phenomenon in the logarithmic coordinate system. It is closely related to the urban public security index.Originality/valueBased on group-shared dynamic index integrated alarm, we innovatively constructed an urban public safety index and analyzed the correlation of travel alarm behavior. The research results fully reveal the internal mechanism of the group behavior safety index and provide a valuable supplement for the police intelligence analysis.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48065288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-23DOI: 10.1108/dta-09-2021-0240
Caihua Yu, Tonghui Lian, Hongbao Geng, Sixin Li
PurposeThis paper gathers tourism digital footprint from online travel platforms, choosing social network analysis method to learn the structure of destination networks and to probe into the features of tourist flow network structure and flow characteristics in Guilin of China.Design/methodology/approachThe digital footprint of tourists can be applied to study the behaviors and laws of digital footprint. This research contributes to improving the understanding of demand-driven network relationships among tourist attractions in a destination.Findings(1) Yulong River, Yangshuo West Street, Longji Terraced Fields, Silver Rock and Four Lakes are the divergent and agglomerative centers of tourist flow, which are the top tourist attractions for transiting tourists. (2) The core-periphery structure of the network is clearly stratified. More specifically, the core nodes in the network are prominent and the core area of the network has weak interaction with the peripheral area. (3) There are eight cohesive subgroups in the network structure, which contains certain differences in the radiation effects.Originality/valueThis research aims at exploring the spatial network structure characteristics of tourism flows in Guilin by analyzing the online footprints of tourists. It takes a good try to analyze the application of network footprint with the research of tourism flow characteristics, and also provides a theoretical reference for the design of tourist routes and the cooperative marketing among various attractions.
{"title":"Analyzing the structure of tourism destination network based on digital footprints: taking Guilin, China as a case","authors":"Caihua Yu, Tonghui Lian, Hongbao Geng, Sixin Li","doi":"10.1108/dta-09-2021-0240","DOIUrl":"https://doi.org/10.1108/dta-09-2021-0240","url":null,"abstract":"PurposeThis paper gathers tourism digital footprint from online travel platforms, choosing social network analysis method to learn the structure of destination networks and to probe into the features of tourist flow network structure and flow characteristics in Guilin of China.Design/methodology/approachThe digital footprint of tourists can be applied to study the behaviors and laws of digital footprint. This research contributes to improving the understanding of demand-driven network relationships among tourist attractions in a destination.Findings(1) Yulong River, Yangshuo West Street, Longji Terraced Fields, Silver Rock and Four Lakes are the divergent and agglomerative centers of tourist flow, which are the top tourist attractions for transiting tourists. (2) The core-periphery structure of the network is clearly stratified. More specifically, the core nodes in the network are prominent and the core area of the network has weak interaction with the peripheral area. (3) There are eight cohesive subgroups in the network structure, which contains certain differences in the radiation effects.Originality/valueThis research aims at exploring the spatial network structure characteristics of tourism flows in Guilin by analyzing the online footprints of tourists. It takes a good try to analyze the application of network footprint with the research of tourism flow characteristics, and also provides a theoretical reference for the design of tourist routes and the cooperative marketing among various attractions.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89735602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-04DOI: 10.1108/dta-02-2022-0083
Dhanya Pramod
PurposeThis study explores privacy challenges in recommender systems (RSs) and how they have leveraged privacy-preserving technology for risk mitigation. The study also elucidates the extent of adopting privacy-preserving RSs and postulates the future direction of research in RS security.Design/methodology/approachThe study gathered articles from well-known databases such as SCOPUS, Web of Science and Google scholar. A systematic literature review using PRISMA was carried out on the 41 papers that are shortlisted for study. Two research questions were framed to carry out the review.FindingsIt is evident from this study that privacy issues in the RS have been addressed with various techniques. However, many more challenges are expected while leveraging technology advancements for fine-tuning recommenders, and a research agenda has been devised by postulating future directions.Originality/valueThe study unveils a new comprehensive perspective regarding privacy preservation in recommenders. There is no promising study found that gathers techniques used for privacy protection. The study summarizes the research agenda, and it will be a good reference article for those who develop privacy-preserving RSs.
本研究探讨了推荐系统(RSs)中的隐私挑战，以及它们如何利用隐私保护技术来降低风险。该研究还阐明了采用隐私保护RSs的程度，并对RS安全的未来研究方向进行了展望。设计/方法/方法本研究从SCOPUS、Web of Science和Google scholar等知名数据库中收集文章。采用PRISMA对入选的41篇论文进行系统的文献综述。为了进行审查，我们提出了两个研究问题。从这项研究中可以明显看出，RS中的隐私问题已经通过各种技术得到了解决。然而，在利用技术进步进行微调推荐时，预计会遇到更多挑战，并且通过假设未来的方向设计了一个研究议程。独创性/价值该研究揭示了关于推荐人隐私保护的一个新的综合视角。没有一项有希望的研究发现收集了用于隐私保护的技术。该研究总结了研究议程，对于开发保护隐私RSs的人来说是一篇很好的参考文章。
{"title":"Privacy-preserving techniques in recommender systems: state-of-the-art review and future research agenda","authors":"Dhanya Pramod","doi":"10.1108/dta-02-2022-0083","DOIUrl":"https://doi.org/10.1108/dta-02-2022-0083","url":null,"abstract":"PurposeThis study explores privacy challenges in recommender systems (RSs) and how they have leveraged privacy-preserving technology for risk mitigation. The study also elucidates the extent of adopting privacy-preserving RSs and postulates the future direction of research in RS security.Design/methodology/approachThe study gathered articles from well-known databases such as SCOPUS, Web of Science and Google scholar. A systematic literature review using PRISMA was carried out on the 41 papers that are shortlisted for study. Two research questions were framed to carry out the review.FindingsIt is evident from this study that privacy issues in the RS have been addressed with various techniques. However, many more challenges are expected while leveraging technology advancements for fine-tuning recommenders, and a research agenda has been devised by postulating future directions.Originality/valueThe study unveils a new comprehensive perspective regarding privacy preservation in recommenders. There is no promising study found that gathers techniques used for privacy protection. The study summarizes the research agenda, and it will be a good reference article for those who develop privacy-preserving RSs.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87140677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-22DOI: 10.1108/dta-06-2021-0160
Heng-yang Lu, Jun Yang, Wei Fang, Xiaoning Song, Chongjun Wang
PurposeThe COVID-19 has become a global pandemic, which has caused large number of deaths and huge economic losses. These losses are not only caused by the virus but also by the related rumors. Nowadays, online social media are quite popular, where billions of people express their opinions and propagate information. Rumors about COVID-19 posted on online social media usually spread rapidly; it is hard to analyze and detect rumors only by artificial processing. The purpose of this paper is to propose a novel model called the Topic-Comment-based Rumor Detection model (TopCom) to detect rumors as soon as possible.Design/methodology/approachThe authors conducted COVID-19 rumor detection from Sina Weibo, one of the most widely used Chinese online social media. The authors constructed a dataset about COVID-19 from January 1 to June 30, 2020 with a web crawler, including both rumor and non-rumors. The rumor detection task is regarded as a binary classification problem. The proposed TopCom model exploits the topical memory networks to fuse latent topic information with original microblogs, which solves the sparsity problems brought by short-text microblogs. In addition, TopCom fuses comments with corresponding microblogs to further improve the performance.FindingsExperimental results on a publicly available dataset and the proposed COVID dataset have shown superiority and efficiency compared with baselines. The authors further randomly selected microblogs posted from July 1–31, 2020 for the case study, which also shows the effectiveness and application prospects for detecting rumors about COVID-19 automatically.Originality/valueThe originality of TopCom lies in the fusion of latent topic information of original microblogs and corresponding comments with DNNs-based models for the COVID-19 rumor detection task, whose value is to help detect rumors automatically in a short time.
{"title":"A deep neural networks-based fusion model for COVID-19 rumor detection from online social media","authors":"Heng-yang Lu, Jun Yang, Wei Fang, Xiaoning Song, Chongjun Wang","doi":"10.1108/dta-06-2021-0160","DOIUrl":"https://doi.org/10.1108/dta-06-2021-0160","url":null,"abstract":"PurposeThe COVID-19 has become a global pandemic, which has caused large number of deaths and huge economic losses. These losses are not only caused by the virus but also by the related rumors. Nowadays, online social media are quite popular, where billions of people express their opinions and propagate information. Rumors about COVID-19 posted on online social media usually spread rapidly; it is hard to analyze and detect rumors only by artificial processing. The purpose of this paper is to propose a novel model called the Topic-Comment-based Rumor Detection model (TopCom) to detect rumors as soon as possible.Design/methodology/approachThe authors conducted COVID-19 rumor detection from Sina Weibo, one of the most widely used Chinese online social media. The authors constructed a dataset about COVID-19 from January 1 to June 30, 2020 with a web crawler, including both rumor and non-rumors. The rumor detection task is regarded as a binary classification problem. The proposed TopCom model exploits the topical memory networks to fuse latent topic information with original microblogs, which solves the sparsity problems brought by short-text microblogs. In addition, TopCom fuses comments with corresponding microblogs to further improve the performance.FindingsExperimental results on a publicly available dataset and the proposed COVID dataset have shown superiority and efficiency compared with baselines. The authors further randomly selected microblogs posted from July 1–31, 2020 for the case study, which also shows the effectiveness and application prospects for detecting rumors about COVID-19 automatically.Originality/valueThe originality of TopCom lies in the fusion of latent topic information of original microblogs and corresponding comments with DNNs-based models for the COVID-19 rumor detection task, whose value is to help detect rumors automatically in a short time.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74968915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-20DOI: 10.1108/dta-01-2022-0047
T. Banditwattanawong, A. Jankasem, Masawee Masdisornchote
PurposeFair grading produces learning ability levels that are understandable and acceptable to both learners and instructors. Norm-referenced grading can be achieved by several means such as z score, K-means and a heuristic. However, these methods typically deliver the varied degrees of grading fairness depending on input score data.Design/methodology/approachTo attain the fairest grading, this paper proposes a hybrid algorithm that integrates z score, K-means and heuristic methods with a novel fairness objective function as a decision function.FindingsDepending on an experimented data set, each of the algorithm's constituent methods could deliver the fairest grading results with fairness degrees ranging from 0.110 to 0.646. We also pointed out key factors in the fairness improvement of norm-referenced achievement grading.Originality/valueThe main contributions of this paper are four folds: the definition of fair norm-referenced grading requirements, a hybrid algorithm for fair norm-referenced grading, a fairness metric for norm-referenced grading and the fairness performance results of the statistical, heuristic and machine learning methods.
{"title":"Hybrid data analytic technique for grading fairness","authors":"T. Banditwattanawong, A. Jankasem, Masawee Masdisornchote","doi":"10.1108/dta-01-2022-0047","DOIUrl":"https://doi.org/10.1108/dta-01-2022-0047","url":null,"abstract":"PurposeFair grading produces learning ability levels that are understandable and acceptable to both learners and instructors. Norm-referenced grading can be achieved by several means such as z score, K-means and a heuristic. However, these methods typically deliver the varied degrees of grading fairness depending on input score data.Design/methodology/approachTo attain the fairest grading, this paper proposes a hybrid algorithm that integrates z score, K-means and heuristic methods with a novel fairness objective function as a decision function.FindingsDepending on an experimented data set, each of the algorithm's constituent methods could deliver the fairest grading results with fairness degrees ranging from 0.110 to 0.646. We also pointed out key factors in the fairness improvement of norm-referenced achievement grading.Originality/valueThe main contributions of this paper are four folds: the definition of fair norm-referenced grading requirements, a hybrid algorithm for fair norm-referenced grading, a fairness metric for norm-referenced grading and the fairness performance results of the statistical, heuristic and machine learning methods.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83654519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-15DOI: 10.1108/dta-07-2021-0182
Rahul Shrivastava, Dilip Singh Sisodia, N. K. Nagwani
PurposeIn a multi-stakeholder recommender system (MSRS), stakeholders are the multiple entities (consumer, producer, system, etc.) benefited by the generated recommendations. Traditionally, the exclusive focus on only a single stakeholders' (for example, only consumer or end-user) preferences obscured the welfare of the others. Two major challenges are encountered while incorporating the multiple stakeholders' perspectives in MSRS: designing a dedicated utility function for each stakeholder and optimizing their utility without hurting others. This paper proposes multiple utility functions for different stakeholders and optimizes these functions for generating balanced, personalized recommendations for each stakeholder.Design/methodology/approachThe proposed methodology considers four valid stakeholders user, producer, cast and recommender system from the multi-stakeholder recommender setting and builds dedicated utility functions. The utility function for users incorporates enhanced side-information-based similarity computation for utility count. Similarly, to improve the utility gain, the authors design new utility functions for producer, star-cast and system to incorporate long-tail and diverse items in the recommendation list. Next, to balance the utility gain and generate the trade-off recommendation solution, the authors perform the evolutionary optimization of the conflicting utility functions using NSGA-II. Experimental evaluation and comparison are conducted over three benchmark data sets.FindingsThe authors observed 19.70% of average enhancement in utility gain with improved mean precision, diversity and novelty. Exposure, hit, reach and target reach metrics are substantially improved.Originality/valueA new approach considers four stakeholders simultaneously with their respective utility functions and establishes the trade-off recommendation solution between conflicting utilities of the stakeholders.
{"title":"Utility optimization-based multi-stakeholder personalized recommendation system","authors":"Rahul Shrivastava, Dilip Singh Sisodia, N. K. Nagwani","doi":"10.1108/dta-07-2021-0182","DOIUrl":"https://doi.org/10.1108/dta-07-2021-0182","url":null,"abstract":"PurposeIn a multi-stakeholder recommender system (MSRS), stakeholders are the multiple entities (consumer, producer, system, etc.) benefited by the generated recommendations. Traditionally, the exclusive focus on only a single stakeholders' (for example, only consumer or end-user) preferences obscured the welfare of the others. Two major challenges are encountered while incorporating the multiple stakeholders' perspectives in MSRS: designing a dedicated utility function for each stakeholder and optimizing their utility without hurting others. This paper proposes multiple utility functions for different stakeholders and optimizes these functions for generating balanced, personalized recommendations for each stakeholder.Design/methodology/approachThe proposed methodology considers four valid stakeholders user, producer, cast and recommender system from the multi-stakeholder recommender setting and builds dedicated utility functions. The utility function for users incorporates enhanced side-information-based similarity computation for utility count. Similarly, to improve the utility gain, the authors design new utility functions for producer, star-cast and system to incorporate long-tail and diverse items in the recommendation list. Next, to balance the utility gain and generate the trade-off recommendation solution, the authors perform the evolutionary optimization of the conflicting utility functions using NSGA-II. Experimental evaluation and comparison are conducted over three benchmark data sets.FindingsThe authors observed 19.70% of average enhancement in utility gain with improved mean precision, diversity and novelty. Exposure, hit, reach and target reach metrics are substantially improved.Originality/valueA new approach considers four stakeholders simultaneously with their respective utility functions and establishes the trade-off recommendation solution between conflicting utilities of the stakeholders.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81241359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-13DOI: 10.1108/dta-08-2021-0205
Xiaofan Liu, Yupeng Zhou, Minghao Yin, Shuai Lv
PurposeThe paper aims to provide an efficient meta-heuristic algorithm to solve the partial set covering problem (PSCP). With rich application scenarios, the PSCP is a fascinating and well-known non-deterministic polynomial (NP)-hard problem whose goal is to cover at least k elements with as few subsets as possible.Design/methodology/approachIn this work, the authors present a novel variant of the ant colony optimization (ACO) algorithm, called Argentine ant system (AAS), to deal with the PSCP. The developed AAS is an integrated system of different populations that use the same pheromone to communicate. Moreover, an effective local search framework with the relaxed configuration checking (RCC) and the volatilization-fixed weight mechanism is proposed to improve the exploitation of the algorithm.FindingsA detailed experimental evaluation of 75 instances reveals that the proposed algorithm outperforms the competitors in terms of the quality of the optimal solutions. Also, the performance of AAS gradually improves with the growing instance size, which shows the potential in handling complex practical scenarios. Finally, the designed components of AAS are experimentally proved to be beneficial to the whole framework. Finally, the key components in AAS have been demonstrated.Originality/valueAt present, there is no heuristic method to solve this problem. The authors present the first implementation of heuristic algorithm for solving PSCP and provide competitive solutions.
{"title":"An Argentine ant system algorithm for partial set covering problem","authors":"Xiaofan Liu, Yupeng Zhou, Minghao Yin, Shuai Lv","doi":"10.1108/dta-08-2021-0205","DOIUrl":"https://doi.org/10.1108/dta-08-2021-0205","url":null,"abstract":"PurposeThe paper aims to provide an efficient meta-heuristic algorithm to solve the partial set covering problem (PSCP). With rich application scenarios, the PSCP is a fascinating and well-known non-deterministic polynomial (NP)-hard problem whose goal is to cover at least k elements with as few subsets as possible.Design/methodology/approachIn this work, the authors present a novel variant of the ant colony optimization (ACO) algorithm, called Argentine ant system (AAS), to deal with the PSCP. The developed AAS is an integrated system of different populations that use the same pheromone to communicate. Moreover, an effective local search framework with the relaxed configuration checking (RCC) and the volatilization-fixed weight mechanism is proposed to improve the exploitation of the algorithm.FindingsA detailed experimental evaluation of 75 instances reveals that the proposed algorithm outperforms the competitors in terms of the quality of the optimal solutions. Also, the performance of AAS gradually improves with the growing instance size, which shows the potential in handling complex practical scenarios. Finally, the designed components of AAS are experimentally proved to be beneficial to the whole framework. Finally, the key components in AAS have been demonstrated.Originality/valueAt present, there is no heuristic method to solve this problem. The authors present the first implementation of heuristic algorithm for solving PSCP and provide competitive solutions.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85384157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-28DOI: 10.1108/dta-08-2021-0209
Ze-Han Fang, C. Chen
PurposeThe purpose of this paper is to propose a novel collaborative trend prediction method to estimate the status of trending topics by crowdsourcing the wisdom in web search engines. Government officials and decision makers can take advantage of the proposed method to effectively analyze various trending topics and make appropriate decisions in response to fast-changing national and international situations or popular opinions.Design/methodology/approachIn this study, a crowdsourced-wisdom-based feature selection method was designed to select representative indicators showing trending topics and concerns of the general public. The authors also designed a novel prediction method to estimate the trending topic statuses by crowdsourcing public opinion in web search engines.FindingsThe authors’ proposed method achieved better results than traditional trend prediction methods and successfully predict trending topic statuses by using the crowdsourced wisdom of web search engines.Originality/valueThis paper proposes a novel collaborative trend prediction method and applied it to various trending topics. The experimental results show that the authors’ method can successfully estimate the trending topic statuses and outperform other baseline methods. To the best of the authors’ knowledge, this is the first such attempt to predict trending topic statuses by using the crowdsourced wisdom of web search engines.
{"title":"A collaborative trend prediction method using the crowdsourced wisdom of web search engines","authors":"Ze-Han Fang, C. Chen","doi":"10.1108/dta-08-2021-0209","DOIUrl":"https://doi.org/10.1108/dta-08-2021-0209","url":null,"abstract":"PurposeThe purpose of this paper is to propose a novel collaborative trend prediction method to estimate the status of trending topics by crowdsourcing the wisdom in web search engines. Government officials and decision makers can take advantage of the proposed method to effectively analyze various trending topics and make appropriate decisions in response to fast-changing national and international situations or popular opinions.Design/methodology/approachIn this study, a crowdsourced-wisdom-based feature selection method was designed to select representative indicators showing trending topics and concerns of the general public. The authors also designed a novel prediction method to estimate the trending topic statuses by crowdsourcing public opinion in web search engines.FindingsThe authors’ proposed method achieved better results than traditional trend prediction methods and successfully predict trending topic statuses by using the crowdsourced wisdom of web search engines.Originality/valueThis paper proposes a novel collaborative trend prediction method and applied it to various trending topics. The experimental results show that the authors’ method can successfully estimate the trending topic statuses and outperform other baseline methods. To the best of the authors’ knowledge, this is the first such attempt to predict trending topic statuses by using the crowdsourced wisdom of web search engines.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80768703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-18DOI: 10.1108/dta-05-2021-0123
P. K. Sinha, Biswanath Dutta, Udaya Varadarajan
PurposeThe current work provides a framework for the ranking of ontology development methodologies (ODMs).Design/methodology/approachThe framework is a step-by-step approach reinforced by an array of ranking features and a quantitative tool, weighted decision matrix. An extensive literature investigation revealed a set of aspects that regulate ODMs. The aspects and existing state-of-the-art estimates facilitated in extracting the features. To determine weight to each of the features, an online survey was implemented to secure evidence from the Semantic Web community. To demonstrate the framework, the authors perform a pilot study, where a collection of domain ODMs, reported in 2000–2019, is used.FindingsState-of-the-art research revealed that ODMs have been accumulated, surveyed and assessed to prescribe the best probable ODM for ontology development. But none of the prevailing studies provide a ranking mechanism for ODMs. The recommended framework overcomes this limitation and gives a systematic and uniform way of ranking the ODMs. The pilot study yielded NeOn as the top-ranked ODM in the recent two decades.Originality/valueThere is no work in the literature that has investigated ranking the ODMs. Hence, this is a first of its kind work in the area of ODM research. The framework supports identifying the topmost ODMs from the literature possessing a substantial amount of features for ontology development. It also enables the selection of the best possible ODM for the ontology development.
{"title":"Ranking the ontology development methodologies using the weighted decision matrix","authors":"P. K. Sinha, Biswanath Dutta, Udaya Varadarajan","doi":"10.1108/dta-05-2021-0123","DOIUrl":"https://doi.org/10.1108/dta-05-2021-0123","url":null,"abstract":"PurposeThe current work provides a framework for the ranking of ontology development methodologies (ODMs).Design/methodology/approachThe framework is a step-by-step approach reinforced by an array of ranking features and a quantitative tool, weighted decision matrix. An extensive literature investigation revealed a set of aspects that regulate ODMs. The aspects and existing state-of-the-art estimates facilitated in extracting the features. To determine weight to each of the features, an online survey was implemented to secure evidence from the Semantic Web community. To demonstrate the framework, the authors perform a pilot study, where a collection of domain ODMs, reported in 2000–2019, is used.FindingsState-of-the-art research revealed that ODMs have been accumulated, surveyed and assessed to prescribe the best probable ODM for ontology development. But none of the prevailing studies provide a ranking mechanism for ODMs. The recommended framework overcomes this limitation and gives a systematic and uniform way of ranking the ODMs. The pilot study yielded NeOn as the top-ranked ODM in the recent two decades.Originality/valueThere is no work in the literature that has investigated ranking the ODMs. Hence, this is a first of its kind work in the area of ODM research. The framework supports identifying the topmost ODMs from the literature possessing a substantial amount of features for ontology development. It also enables the selection of the best possible ODM for the ontology development.","PeriodicalId":56156,"journal":{"name":"Data Technologies and Applications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2022-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86877468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：