Stock-index movement prediction is an important research topic in FinTech because the index indicates the economic status of a whole country. With a set of daily candlesticks of the stock-index, investors could gain a meaningful basis for the prediction of the next day's movement. This paper proposes a stock-index price-movement prediction model, Combined Time-View TabNet (CTV-TabNet), a novel approach that utilizes attributes of the candlesticks data with multi-time windows. Our model comprises three modules: TabNet encoder, gated recurrent unit with a sequence control, and multi-time combiner. They work together to forecast the movements based on the sequential attributes of the candlesticks. CTV-TabNet not only outperforms baseline models in prediction performance on 20 stock-indices of 14 different countries but also yields higher returns of index-futures trading simulations when compared to the baselines. Additionally, our model provides comprehensive interpretations of the stock-index related to its inherent properties in predictive performance.
{"title":"Exploring Candlesticks and Multi-Time Windows for Forecasting Stock-Index Movements","authors":"Kanghyeon Seo, Jihoon Yang","doi":"10.1145/3555776.3577604","DOIUrl":"https://doi.org/10.1145/3555776.3577604","url":null,"abstract":"Stock-index movement prediction is an important research topic in FinTech because the index indicates the economic status of a whole country. With a set of daily candlesticks of the stock-index, investors could gain a meaningful basis for the prediction of the next day's movement. This paper proposes a stock-index price-movement prediction model, Combined Time-View TabNet (CTV-TabNet), a novel approach that utilizes attributes of the candlesticks data with multi-time windows. Our model comprises three modules: TabNet encoder, gated recurrent unit with a sequence control, and multi-time combiner. They work together to forecast the movements based on the sequential attributes of the candlesticks. CTV-TabNet not only outperforms baseline models in prediction performance on 20 stock-indices of 14 different countries but also yields higher returns of index-futures trading simulations when compared to the baselines. Additionally, our model provides comprehensive interpretations of the stock-index related to its inherent properties in predictive performance.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"38 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86773524","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}
In the days of AI, data-centric machine learning (ML) models are increasingly used in various complex systems. While many researchers are focusing on specifying ML-specific performance requirements, not enough guideline is provided to engineer the data requirements systematically involving diverse stakeholders. Lack of written agreement about the training data, collaboration bottlenecks, lack of data validation framework, etc. are posing new challenges to ensuring training data fitness for safety-critical ML components. To reduce these gaps, we propose a multi-layered framework that helps to perceive and elicit data requirements. We provide a template for verifiable data requirements specifications. Moreover, we show how such requirements can facilitate an evidence-driven assessment of the training data quality based on the experts' judgments about the satisfaction of the requirements. We use Dempster Shafer's theory to combine experts' subjective opinions in the process. A preliminary case study on the CityPersons dataset for the pedestrian detection feature of autonomous cars shows the usefulness of the proposed framework for data requirements understanding and the confidence assessment of the dataset.
{"title":"A Multi-layered Collaborative Framework for Evidence-driven Data Requirements Engineering for Machine Learning-based Safety-critical Systems","authors":"Sangeeta Dey, Seok-Won Lee","doi":"10.1145/3555776.3577647","DOIUrl":"https://doi.org/10.1145/3555776.3577647","url":null,"abstract":"In the days of AI, data-centric machine learning (ML) models are increasingly used in various complex systems. While many researchers are focusing on specifying ML-specific performance requirements, not enough guideline is provided to engineer the data requirements systematically involving diverse stakeholders. Lack of written agreement about the training data, collaboration bottlenecks, lack of data validation framework, etc. are posing new challenges to ensuring training data fitness for safety-critical ML components. To reduce these gaps, we propose a multi-layered framework that helps to perceive and elicit data requirements. We provide a template for verifiable data requirements specifications. Moreover, we show how such requirements can facilitate an evidence-driven assessment of the training data quality based on the experts' judgments about the satisfaction of the requirements. We use Dempster Shafer's theory to combine experts' subjective opinions in the process. A preliminary case study on the CityPersons dataset for the pedestrian detection feature of autonomous cars shows the usefulness of the proposed framework for data requirements understanding and the confidence assessment of the dataset.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"35 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89390161","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}
Modern people are used to recording more and more videos using camera applications for keeping and sharing their life on social media and video-sharing platforms. To capture extensive multimedia materials, reducing the power consumption of recorded videos from camera applications plays an important role for user experience of mobile devices. This paper studies how to process and display power-saving videos recorded by camera applications on mobile devices in a real-time manner. Based on pixel-scaling methods, we design an appropriate feature map and adopt a visual attention model under the real-time limitation to effectively access attention distribution. Then, based on segmentation properties, a parallel design is appropriately applied to exploit available computation power. Next, we propose a frame-ratio predictor using machine-learning methods to efficiently predict frame ratios in a frame. Finally, the results of the comprehensive experiments conducted on a commercial smartphone with four real-world videos to evaluate the performance of the proposed design are very encouraging.
{"title":"Exploiting Machine-learning Prediction for Enabling Real-time Pixel-scaling Techniques in Mobile Camera Applications","authors":"S. Wei, Sheng-Da Tsai, Chun-Han Lin","doi":"10.1145/3555776.3577770","DOIUrl":"https://doi.org/10.1145/3555776.3577770","url":null,"abstract":"Modern people are used to recording more and more videos using camera applications for keeping and sharing their life on social media and video-sharing platforms. To capture extensive multimedia materials, reducing the power consumption of recorded videos from camera applications plays an important role for user experience of mobile devices. This paper studies how to process and display power-saving videos recorded by camera applications on mobile devices in a real-time manner. Based on pixel-scaling methods, we design an appropriate feature map and adopt a visual attention model under the real-time limitation to effectively access attention distribution. Then, based on segmentation properties, a parallel design is appropriately applied to exploit available computation power. Next, we propose a frame-ratio predictor using machine-learning methods to efficiently predict frame ratios in a frame. Finally, the results of the comprehensive experiments conducted on a commercial smartphone with four real-world videos to evaluate the performance of the proposed design are very encouraging.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"13 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87027295","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}
Unsupervised side-channel attacks allow extracting secret keys manipulated by cryptographic primitives through leakages of their physical implementations. As opposed to supervised attacks, they do not require a preliminary profiling of the target, constituting a broader threat since they imply weaker assumptions on the adversary model. Their downside is their requirement for some a priori knowledge on the leakage model of the device. On one hand, stochastic attacks such as the Linear Regression Analysis (LRA) allow for a flexible a priori, but are mostly limited to a univariate treatment of the traces. On the other hand, model-based attacks require an explicit formulation of the leakage model but have recently been extended to multidimensional versions allowing to benefit from the potential of Deep Learning (DL) techniques. The EVIL Machine Attack (EMA), introduced in this paper, aims at taking the best of both worlds. Inspired by generative adversarial networks, its architecture is able to recover a representation of the leakage model, which is then turned into a key distinguisher allowing flexible a priori. In addition, state-of-the-art DL techniques require 256 network trainings to conduct the attack. EMA requires only one, scaling down the time complexity of such attacks by a considerable factor. Simulations and real experiments show that EMA is applicable in cases where the adversary has very low knowledge on the leakage model, while significantly reducing the required number of traces compared to a classical LRA. Eventually, a generalization of EMA, able to deal with masked implementation is introduced.
{"title":"The EVIL Machine: Encode, Visualize and Interpret the Leakage","authors":"Valence Cristiani, Maxime Lecomte, P. Maurine","doi":"10.1145/3555776.3577688","DOIUrl":"https://doi.org/10.1145/3555776.3577688","url":null,"abstract":"Unsupervised side-channel attacks allow extracting secret keys manipulated by cryptographic primitives through leakages of their physical implementations. As opposed to supervised attacks, they do not require a preliminary profiling of the target, constituting a broader threat since they imply weaker assumptions on the adversary model. Their downside is their requirement for some a priori knowledge on the leakage model of the device. On one hand, stochastic attacks such as the Linear Regression Analysis (LRA) allow for a flexible a priori, but are mostly limited to a univariate treatment of the traces. On the other hand, model-based attacks require an explicit formulation of the leakage model but have recently been extended to multidimensional versions allowing to benefit from the potential of Deep Learning (DL) techniques. The EVIL Machine Attack (EMA), introduced in this paper, aims at taking the best of both worlds. Inspired by generative adversarial networks, its architecture is able to recover a representation of the leakage model, which is then turned into a key distinguisher allowing flexible a priori. In addition, state-of-the-art DL techniques require 256 network trainings to conduct the attack. EMA requires only one, scaling down the time complexity of such attacks by a considerable factor. Simulations and real experiments show that EMA is applicable in cases where the adversary has very low knowledge on the leakage model, while significantly reducing the required number of traces compared to a classical LRA. Eventually, a generalization of EMA, able to deal with masked implementation is introduced.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"144 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77580079","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}
M. Franceschetti, Roberto Posenato, Carlo Combi, Johann Eder
A Conditional Simple Temporal Network with Uncertainty (CSTNU) models temporal constraint satisfaction problems in which the environment sets uncontrollable timepoints and conditions. The executor observes and reacts to such uncontrollable assignments as time advances with the CSTNU execution. However, there exist scenarios in which the occurrence of some future timepoints must be fixed as soon as the execution starts. We call these timepoints parameters. For a correct execution, parameters must assume values that guarantee the possibility of satisfying all temporal constraints, whatever the environment decides the execution time for uncontrollable timepoints and the truth value of conditions, i.e., dynamic controllability (DC). Here, we formalize the extension of the CSTNU with parameters. Furthermore, we define a set of rules to check the DC of such extended CSTNU. These rules additionally solve the problem inverse to checking DC: computing restrictions on parameter values that yield DC guarantees. The proposed rules can be composed into a sound and complete procedure.
{"title":"Dynamic Controllability of Parameterized CSTNUs","authors":"M. Franceschetti, Roberto Posenato, Carlo Combi, Johann Eder","doi":"10.1145/3555776.3577618","DOIUrl":"https://doi.org/10.1145/3555776.3577618","url":null,"abstract":"A Conditional Simple Temporal Network with Uncertainty (CSTNU) models temporal constraint satisfaction problems in which the environment sets uncontrollable timepoints and conditions. The executor observes and reacts to such uncontrollable assignments as time advances with the CSTNU execution. However, there exist scenarios in which the occurrence of some future timepoints must be fixed as soon as the execution starts. We call these timepoints parameters. For a correct execution, parameters must assume values that guarantee the possibility of satisfying all temporal constraints, whatever the environment decides the execution time for uncontrollable timepoints and the truth value of conditions, i.e., dynamic controllability (DC). Here, we formalize the extension of the CSTNU with parameters. Furthermore, we define a set of rules to check the DC of such extended CSTNU. These rules additionally solve the problem inverse to checking DC: computing restrictions on parameter values that yield DC guarantees. The proposed rules can be composed into a sound and complete procedure.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"52 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76157391","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}
Lucas Pereira, B. Guterres, Kauê Sbrissa, Amanda Mendes, Francisca Vermeulen, L. Lain, Marié Smith, Javier Martinez, Paulo L. J. Drews-Jr, Nelson Duarte, Vinicus Oliveira, S. Botelho, M. Pias
Edge computing is a new development paradigm that brings computational power to the network edge through novel intelligent end-user services. It allows latency-sensitive applications to be placed where the data is created, thus reducing communication overhead and improving security, mobility and power consumption. There is a plethora of applications benefiting from this type of processing. Of particular interest is emerging edge-based image classification at the microscopic level. The scale and magnitude of the objects to segment, detect and classify are very challenging, with data collected using order of magnitude in magnification. The required data processing is intense, and the wish list of end-users in this space includes tools and solutions that fit into a desk-based device. Taking heavy-lift classification models initially built in the cloud to desk-based image analysis devices is a hard job for application developers. This work looks at the performance limitations and energy consumption footprint in embedding deep learning classification models in a representative edge computing device. Particularly, the dataset and heavy-lift models explored in the case study are phytoplankton images to detect Harmful Algae Blooms (HAB) in aquaculture at early stages. The work takes a deep learning model trained for phytoplankton classification and deploys it at the edge. The embedded model, deployed in a base form alongside optimised options, is submitted to a series of system stress experiments. The performance and power consumption profiling help understand system limitations and their impact on the microscopic grade image classification task.
{"title":"The not-so-easy task of taking heavy-lift ML models to the edge: a performance-watt perspective","authors":"Lucas Pereira, B. Guterres, Kauê Sbrissa, Amanda Mendes, Francisca Vermeulen, L. Lain, Marié Smith, Javier Martinez, Paulo L. J. Drews-Jr, Nelson Duarte, Vinicus Oliveira, S. Botelho, M. Pias","doi":"10.1145/3555776.3577742","DOIUrl":"https://doi.org/10.1145/3555776.3577742","url":null,"abstract":"Edge computing is a new development paradigm that brings computational power to the network edge through novel intelligent end-user services. It allows latency-sensitive applications to be placed where the data is created, thus reducing communication overhead and improving security, mobility and power consumption. There is a plethora of applications benefiting from this type of processing. Of particular interest is emerging edge-based image classification at the microscopic level. The scale and magnitude of the objects to segment, detect and classify are very challenging, with data collected using order of magnitude in magnification. The required data processing is intense, and the wish list of end-users in this space includes tools and solutions that fit into a desk-based device. Taking heavy-lift classification models initially built in the cloud to desk-based image analysis devices is a hard job for application developers. This work looks at the performance limitations and energy consumption footprint in embedding deep learning classification models in a representative edge computing device. Particularly, the dataset and heavy-lift models explored in the case study are phytoplankton images to detect Harmful Algae Blooms (HAB) in aquaculture at early stages. The work takes a deep learning model trained for phytoplankton classification and deploys it at the edge. The embedded model, deployed in a base form alongside optimised options, is submitted to a series of system stress experiments. The performance and power consumption profiling help understand system limitations and their impact on the microscopic grade image classification task.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"9 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75864732","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}
In this paper we use a Twitter dataset collected between December 8, 2021 and February 18, 2022 towards the 2022 Russian invasion of Ukraine to design a data processing pipeline featuring a high accuracy Graph Convolutional Network (GCN) based political camp classifier, a botnet detection algorithm and a robust measure of botnet effects. Our experiments reveal that while the pro-Russian botnet contributes significantly to network polarization, the pro-Ukrainian botnet contributes with moderating effects. In order to understand the factors leading to different effects, we analyze the interactions between the botnets and the barrier-crossing vs. barrier-bound users on their own camps. We observe that, where as the pro-Russian botnet amplifies barrier-bound partisan users on their own camp majority of the time, the pro-Ukrainian botnet amplifies barrier-crossing users on their own camp alongside themselves majority of the time.
{"title":"Detecting and Measuring the Polarization Effects of Adversarial Botnets on Twitter","authors":"Yeonjung Lee, M. Ozer, S. Corman, H. Davulcu","doi":"10.1145/3555776.3577730","DOIUrl":"https://doi.org/10.1145/3555776.3577730","url":null,"abstract":"In this paper we use a Twitter dataset collected between December 8, 2021 and February 18, 2022 towards the 2022 Russian invasion of Ukraine to design a data processing pipeline featuring a high accuracy Graph Convolutional Network (GCN) based political camp classifier, a botnet detection algorithm and a robust measure of botnet effects. Our experiments reveal that while the pro-Russian botnet contributes significantly to network polarization, the pro-Ukrainian botnet contributes with moderating effects. In order to understand the factors leading to different effects, we analyze the interactions between the botnets and the barrier-crossing vs. barrier-bound users on their own camps. We observe that, where as the pro-Russian botnet amplifies barrier-bound partisan users on their own camp majority of the time, the pro-Ukrainian botnet amplifies barrier-crossing users on their own camp alongside themselves majority of the time.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"50 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85730015","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}
Graph related tasks, such as graph classification and clustering, have been substantially improved with the advent of graph neural networks (GNNs). However, existing graph embedding models focus on homogeneous graphs that ignore the heterogeneity of the graphs. Therefore, using homogeneous graph embedding models on heterogeneous graphs discards the rich semantics of graphs and achieves average performance, especially by utilizing unlabeled information. However, limited work has been done on whole heterogeneous graph embedding as a supervised task. In light of this, we investigate unsupervised distributed representations learning on heterogeneous graphs and propose a novel model named G-HIN2Vec, Graph-Level Heterogeneous Information Network to Vector. Inspired by recent advances of unsupervised learning in natural language processing, G-HIN2Vec utilizes negative sampling technique as an unlabeled approach and learns graph embedding matrix from different pre-defined meta-paths. We conduct a variety of experiments on three main graph downstream applications on different socio-demographic cardholder features, graph regression, graph clustering, and graph classification, such as gender classification, age, and income prediction, which shows superior performance of our proposed GNN model on real-world financial credit card data.
{"title":"G-HIN2Vec: Distributed heterogeneous graph representations for cardholder transactions","authors":"Farouk Damoun, H. Seba, Jean Hilger, R. State","doi":"10.1145/3555776.3577740","DOIUrl":"https://doi.org/10.1145/3555776.3577740","url":null,"abstract":"Graph related tasks, such as graph classification and clustering, have been substantially improved with the advent of graph neural networks (GNNs). However, existing graph embedding models focus on homogeneous graphs that ignore the heterogeneity of the graphs. Therefore, using homogeneous graph embedding models on heterogeneous graphs discards the rich semantics of graphs and achieves average performance, especially by utilizing unlabeled information. However, limited work has been done on whole heterogeneous graph embedding as a supervised task. In light of this, we investigate unsupervised distributed representations learning on heterogeneous graphs and propose a novel model named G-HIN2Vec, Graph-Level Heterogeneous Information Network to Vector. Inspired by recent advances of unsupervised learning in natural language processing, G-HIN2Vec utilizes negative sampling technique as an unlabeled approach and learns graph embedding matrix from different pre-defined meta-paths. We conduct a variety of experiments on three main graph downstream applications on different socio-demographic cardholder features, graph regression, graph clustering, and graph classification, such as gender classification, age, and income prediction, which shows superior performance of our proposed GNN model on real-world financial credit card data.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"129 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78581158","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}
In this paper, we study device driver architectures on two different operating systems, Fuchsia and Linux. Fuchsia is a relatively new operating system developed by Google and it is based on a microkernel named Zircon, while Linux-based operating system is based on a monolithic kernel. This paper examines technical details of device driver on Fuchsia and Linux operating systems with the focus on different kernel designs. We also quantitatively evaluate the performance of device drivers on both operating systems by measuring I/O throughput in a real device.
{"title":"Comparative Study on Fuchsia and Linux Device Driver Architecture","authors":"Taejoon Song, Youngjin Kim","doi":"10.1145/3555776.3577828","DOIUrl":"https://doi.org/10.1145/3555776.3577828","url":null,"abstract":"In this paper, we study device driver architectures on two different operating systems, Fuchsia and Linux. Fuchsia is a relatively new operating system developed by Google and it is based on a microkernel named Zircon, while Linux-based operating system is based on a monolithic kernel. This paper examines technical details of device driver on Fuchsia and Linux operating systems with the focus on different kernel designs. We also quantitatively evaluate the performance of device drivers on both operating systems by measuring I/O throughput in a real device.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"20 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78792967","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}
The adoption of semantic technologies for the representation of crime events can help law enforcement agencies (LEAs) in crime prevention and investigation. Moreover, online newspapers and social networks are valuable sources for crime intelligence gathering. In this paper, we propose a new lightweight ontology to model crime events as they are usually described in online news articles. The Crime Event Model (CEM) can integrate specific data about crimes, i.e., where and when they occurred, who is involved (author, victim, and other subjects involved), which is the reason for the occurrence, and details about the source of information (e.g., the news article). Extracting structured data from multiple online sources and interconnecting them in a Knowledge Graph using CEM allow events relationships extraction, patterns and trends identification, and event recommendation. The CEM ontology is available at https://w3id.org/CEMontology.
{"title":"CEM: an Ontology for Crime Events in Newspaper Articles","authors":"Federica Rollo, Laura Po, Alessandro Castellucci","doi":"10.1145/3555776.3577862","DOIUrl":"https://doi.org/10.1145/3555776.3577862","url":null,"abstract":"The adoption of semantic technologies for the representation of crime events can help law enforcement agencies (LEAs) in crime prevention and investigation. Moreover, online newspapers and social networks are valuable sources for crime intelligence gathering. In this paper, we propose a new lightweight ontology to model crime events as they are usually described in online news articles. The Crime Event Model (CEM) can integrate specific data about crimes, i.e., where and when they occurred, who is involved (author, victim, and other subjects involved), which is the reason for the occurrence, and details about the source of information (e.g., the news article). Extracting structured data from multiple online sources and interconnecting them in a Knowledge Graph using CEM allow events relationships extraction, patterns and trends identification, and event recommendation. The CEM ontology is available at https://w3id.org/CEMontology.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"10 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78904472","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：