For incomplete information systems, the existing variable multi granularity rough set and weighted multi granularity rough set are extended, and a variable and weighted granularity "logic disjunction" degree multi granularity rough set based on limited tolerance relation is proposed. The properties and relations of variable and weighted granularity "logic disjunction" degree multi granularity rough set, variable degree multi granularity rough set and weighted degree multi granularity rough set are studied. Finally, the effectiveness of the model and related properties is verified by example analysis and experiments.
{"title":"Variable and Weighted Granularity \"Logic Disjunction\" Degree Multi Granularity Rough Set","authors":"Xiaoyan Wang, Tao Zhu, Yuanxia Shen","doi":"10.1145/3507548.3507583","DOIUrl":"https://doi.org/10.1145/3507548.3507583","url":null,"abstract":"For incomplete information systems, the existing variable multi granularity rough set and weighted multi granularity rough set are extended, and a variable and weighted granularity \"logic disjunction\" degree multi granularity rough set based on limited tolerance relation is proposed. The properties and relations of variable and weighted granularity \"logic disjunction\" degree multi granularity rough set, variable degree multi granularity rough set and weighted degree multi granularity rough set are studied. Finally, the effectiveness of the model and related properties is verified by example analysis and experiments.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133261798","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 field of mobile customer service, the increase of traffic volume and the drop of connection rate caused by uncertain factors are called bursty events. When bursty events occur, detecting the bursty events timely and proactively can improve resource scheduling efficiency, connection rate, and customer satisfaction. The existing bursty events detection methods are mainly dependent on human experience, which detect events untimely and incompletely. In this paper, an unsupervised approach of detecting bursty events based on speech-to-text data is proposed, which makes good use of multiple dimensional features of the field to detect and track bursty events. Using our method, we achieve performances of 90.46%, 86.22% and 86.15% w.r.t. the average precision, recall and F1 score respectively. The experimental results demonstrate that the proposed method is effective to detect bursty events among considerable speech-to-text data.
{"title":"Bursty Events Detection with the Field of Mobile Customer Service","authors":"Lili Kong, Chao Xue, Naiyu Tan","doi":"10.1145/3507548.3507622","DOIUrl":"https://doi.org/10.1145/3507548.3507622","url":null,"abstract":"In the field of mobile customer service, the increase of traffic volume and the drop of connection rate caused by uncertain factors are called bursty events. When bursty events occur, detecting the bursty events timely and proactively can improve resource scheduling efficiency, connection rate, and customer satisfaction. The existing bursty events detection methods are mainly dependent on human experience, which detect events untimely and incompletely. In this paper, an unsupervised approach of detecting bursty events based on speech-to-text data is proposed, which makes good use of multiple dimensional features of the field to detect and track bursty events. Using our method, we achieve performances of 90.46%, 86.22% and 86.15% w.r.t. the average precision, recall and F1 score respectively. The experimental results demonstrate that the proposed method is effective to detect bursty events among considerable speech-to-text data.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122199998","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}
Shuo Liu, Li-wen Xu, Jin-Rong Wang, Yan Sun, Zeran Qin
Anomaly detection is pivotal and challenging in artificial intelligence, which aims to determine whether a query sample comes from the same class, given a set of normal samples from a particular class. There are a plethora of anomaly detection methods based on generative models; however, these methods aim to make the reconstruction error of the training samples smaller or extract more information from the training samples. We believe that it is more important for anomaly detection to extract crucial representation from normal samples rather than more information, so we propose a semi-supervised method named LCR-GAN. We conducted extensive experiments on four image datasets and 15 tabular datasets to demonstrate the effectiveness of the proposed method. Meanwhile, we also carried out an anti-noise study to demonstrate the robustness of the proposed method.
{"title":"LCR-GAN: Learning Crucial Representation for Anomaly Detection","authors":"Shuo Liu, Li-wen Xu, Jin-Rong Wang, Yan Sun, Zeran Qin","doi":"10.1145/3507548.3508229","DOIUrl":"https://doi.org/10.1145/3507548.3508229","url":null,"abstract":"Anomaly detection is pivotal and challenging in artificial intelligence, which aims to determine whether a query sample comes from the same class, given a set of normal samples from a particular class. There are a plethora of anomaly detection methods based on generative models; however, these methods aim to make the reconstruction error of the training samples smaller or extract more information from the training samples. We believe that it is more important for anomaly detection to extract crucial representation from normal samples rather than more information, so we propose a semi-supervised method named LCR-GAN. We conducted extensive experiments on four image datasets and 15 tabular datasets to demonstrate the effectiveness of the proposed method. Meanwhile, we also carried out an anti-noise study to demonstrate the robustness of the proposed method.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127504005","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 order to real time and accurately detect the action of human falling, combined with lightweight detection network, Kalman filter tracking, posture estimation network and spatiotemporal graph convolutional network, a joint algorithm for human fall detection in video is proposed. Firstly, the lightweight YOLOv3-Tiny algorithm is used to locate the frame of human in video, which can quickly detect the human-frame; among them, for the situation that the human body is likely to be missed in video, the Kalman filter tracking algorithm is integrated into the stage of target-detection and the accuracy of detecting is improved. Secondly, the human-frame detected or tracked in video is sent to the AlphaPose network to estimate the posture graph about human body. Finally, the spatiotemporal graph convolutional network is exploited to extract the spatiotemporal features of the human body, and eventually the result for classification is output. Experimental results show that the algorithm proposed in this paper, which is more appealing and successful than the other algorithm.
{"title":"Human Fall Detection Model with Lightweight Network and Tracking in Video","authors":"Xiaoli Ren, Yunjie Zhang, Yanrong Yang","doi":"10.1145/3507548.3507549","DOIUrl":"https://doi.org/10.1145/3507548.3507549","url":null,"abstract":"In order to real time and accurately detect the action of human falling, combined with lightweight detection network, Kalman filter tracking, posture estimation network and spatiotemporal graph convolutional network, a joint algorithm for human fall detection in video is proposed. Firstly, the lightweight YOLOv3-Tiny algorithm is used to locate the frame of human in video, which can quickly detect the human-frame; among them, for the situation that the human body is likely to be missed in video, the Kalman filter tracking algorithm is integrated into the stage of target-detection and the accuracy of detecting is improved. Secondly, the human-frame detected or tracked in video is sent to the AlphaPose network to estimate the posture graph about human body. Finally, the spatiotemporal graph convolutional network is exploited to extract the spatiotemporal features of the human body, and eventually the result for classification is output. Experimental results show that the algorithm proposed in this paper, which is more appealing and successful than the other algorithm.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121085950","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}
Lightweight object detection models have great application prospects in resource-restricted scenarios such as mobile and embedded devices, and have been a hot topic in the computer vision community. However, most existing lightweight object detection methods show poor detection accuracy. In this study, we put forward a lightweight objection detection model named Enhanced-YOLOv3-tiny to improve the detection accuracy and reduce the model complexity at the same time. In Enhanced-YOLOv3-tiny, we propose a new backbone named GhostDarkNet based on DarkNet53 and Ghost Module for decreasing the model parameters, which helps to get more representative features compared with YOLOv3-tiny. Furthermore, we put forward a new Multiscale Head, which adds three more heads and includes Ghost Module in each head to fuse multi-scale features. Experiments on the Priority Research Application dataset from the real scenes in driving show that the proposed Enhanced-YOLOv3-tiny outperforms the state-of-the-art YOLOv3-tiny by 8.4% improvement in AP metric and decreases parameters from 8.8M to 3.9M, demonstrating the application potentials of our proposed method in resource-constrained scenarios.
轻量级目标检测模型在移动和嵌入式设备等资源受限场景中具有很大的应用前景，一直是计算机视觉界的研究热点。然而，现有的大多数轻量化目标检测方法检测精度较差。在本研究中，我们提出了一种轻量级的目标检测模型Enhanced-YOLOv3-tiny，在提高检测精度的同时降低模型复杂度。在Enhanced-YOLOv3-tiny中，我们提出了一种基于DarkNet53和Ghost Module的新主干GhostDarkNet，以减少模型参数，从而获得比YOLOv3-tiny更具代表性的特征。在此基础上，我们提出了一种新的多尺度磁头，该磁头增加了3个磁头，并在每个磁头中加入Ghost Module以融合多尺度特征。在Priority Research Application真实驾驶场景数据集上的实验表明，本文提出的Enhanced-YOLOv3-tiny在AP度量上比最先进的YOLOv3-tiny提高了8.4%，并将参数从8.8M降至3.9M，证明了本文提出的方法在资源受限场景下的应用潜力。
{"title":"Enhanced Efficient YOLOv3-tiny for Object Detection","authors":"Huanqia Cai, Lele Xu, Lili Guo","doi":"10.1145/3507548.3507551","DOIUrl":"https://doi.org/10.1145/3507548.3507551","url":null,"abstract":"Lightweight object detection models have great application prospects in resource-restricted scenarios such as mobile and embedded devices, and have been a hot topic in the computer vision community. However, most existing lightweight object detection methods show poor detection accuracy. In this study, we put forward a lightweight objection detection model named Enhanced-YOLOv3-tiny to improve the detection accuracy and reduce the model complexity at the same time. In Enhanced-YOLOv3-tiny, we propose a new backbone named GhostDarkNet based on DarkNet53 and Ghost Module for decreasing the model parameters, which helps to get more representative features compared with YOLOv3-tiny. Furthermore, we put forward a new Multiscale Head, which adds three more heads and includes Ghost Module in each head to fuse multi-scale features. Experiments on the Priority Research Application dataset from the real scenes in driving show that the proposed Enhanced-YOLOv3-tiny outperforms the state-of-the-art YOLOv3-tiny by 8.4% improvement in AP metric and decreases parameters from 8.8M to 3.9M, demonstrating the application potentials of our proposed method in resource-constrained scenarios.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115587522","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}
Low-dimensional feature regression is a common problem in various disciplines, such as chemistry, kinetics, and medicine, etc. Most common solutions are based on machine learning, but as deep learning evolves, there is room for performance improvements. A few researchers have proposed deep learning-based solutions such as ResidualNet, GrowNet and EnsembleNet. The latter two methods are both boost methods, which are more suitable for shallow network, and the model performance is basically determined by the first model, with limited effect of subsequent boosting steps. We propose a method based on self-distillation and bagging, which selects the well-performing base model and distills several student models by appropriate regression distillation algorithm. Finally, the output of these student models is averaged as the final result. This integration method can be applied to any form of network. The method achieves good results in the CASP dataset, and the R2(Coefficient of Determination) of the model is improved from (0.65) to (0.70) in comparison with the best base model ResidualNet.
{"title":"Regression Algorithm Based on Self-Distillation and Ensemble Learning","authors":"Yaqi Li, Qiwen Dong, Gang Liu","doi":"10.1145/3507548.3507580","DOIUrl":"https://doi.org/10.1145/3507548.3507580","url":null,"abstract":"Low-dimensional feature regression is a common problem in various disciplines, such as chemistry, kinetics, and medicine, etc. Most common solutions are based on machine learning, but as deep learning evolves, there is room for performance improvements. A few researchers have proposed deep learning-based solutions such as ResidualNet, GrowNet and EnsembleNet. The latter two methods are both boost methods, which are more suitable for shallow network, and the model performance is basically determined by the first model, with limited effect of subsequent boosting steps. We propose a method based on self-distillation and bagging, which selects the well-performing base model and distills several student models by appropriate regression distillation algorithm. Finally, the output of these student models is averaged as the final result. This integration method can be applied to any form of network. The method achieves good results in the CASP dataset, and the R2(Coefficient of Determination) of the model is improved from (0.65) to (0.70) in comparison with the best base model ResidualNet.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128657555","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 recent years, with the continuous improvement of teaching informatization, online teaching or online and offline hybrid teaching has become the new normal of teaching in some schools. However, the biggest problem in online teaching is that it is difficult to predict students' academic performance. Therefore, it is necessary to design an effective method to predict students' academic performance more accurately. In this paper, a student academic level prediction method based on stacking model fusion is proposed. Logistic regression, random forest, XGBoost, and Naive Bayes are selected as base learners according to optimal fusion criteria and model properties. Furthermore, the structure and distribution of the features of the dataset are optimized by data preprocessing, feature coding, and feature selection, and the upper limit of the model expression is effectively raised. On this basis, according to the features of dataset and model performance, we select the appropriate model for model fusion, and further improve the prediction effect. Experiments are conducted on OULAD and xAPI datasets, and the results show that the prediction accuracy of the proposed method is better than that of traditional prediction methods. Finally, we analyze the factors that affect academic performance and give some specific suggestions.
{"title":"The Research of Predicting Student's Academic Performance Based on Educational Data","authors":"Yubo Zhang, Yanfang Liu","doi":"10.1145/3507548.3507578","DOIUrl":"https://doi.org/10.1145/3507548.3507578","url":null,"abstract":"In recent years, with the continuous improvement of teaching informatization, online teaching or online and offline hybrid teaching has become the new normal of teaching in some schools. However, the biggest problem in online teaching is that it is difficult to predict students' academic performance. Therefore, it is necessary to design an effective method to predict students' academic performance more accurately. In this paper, a student academic level prediction method based on stacking model fusion is proposed. Logistic regression, random forest, XGBoost, and Naive Bayes are selected as base learners according to optimal fusion criteria and model properties. Furthermore, the structure and distribution of the features of the dataset are optimized by data preprocessing, feature coding, and feature selection, and the upper limit of the model expression is effectively raised. On this basis, according to the features of dataset and model performance, we select the appropriate model for model fusion, and further improve the prediction effect. Experiments are conducted on OULAD and xAPI datasets, and the results show that the prediction accuracy of the proposed method is better than that of traditional prediction methods. Finally, we analyze the factors that affect academic performance and give some specific suggestions.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128727897","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 recent years, the research of computer vision is popular. However, the image data that can be used for computer vision training is very limited, so it is necessary to find an effective method to expand the datasets based on the existing image data. In this paper, we study methods to collect more training data from existing datasets and compare detectors’ performance trained with datasets generated by different methods. One method is to perform sampling-based on statistical properties of feature descriptors. For every feature, the underlying assumption is that a probability density function (PDF) exists, such PDF is approximated with existing training examples and new training examples are sampled from the approximated PDF. The other method is simply to expand the existing datasets by flipping each training example along its symmetric axis. Locally Adaptive Regression Kernel (LARK) feature is used in this paper because it is robust against illumination changes and noise. Our experimental results demonstrate that an expanded training dataset is not always preferable, even if the expanded dataset includes all original training data.
{"title":"Sampling May Not Always Increase Detector Performance: A Study on Collecting Training Examples","authors":"Jun Liu, Shuang Lai","doi":"10.1145/3507548.3507568","DOIUrl":"https://doi.org/10.1145/3507548.3507568","url":null,"abstract":"In recent years, the research of computer vision is popular. However, the image data that can be used for computer vision training is very limited, so it is necessary to find an effective method to expand the datasets based on the existing image data. In this paper, we study methods to collect more training data from existing datasets and compare detectors’ performance trained with datasets generated by different methods. One method is to perform sampling-based on statistical properties of feature descriptors. For every feature, the underlying assumption is that a probability density function (PDF) exists, such PDF is approximated with existing training examples and new training examples are sampled from the approximated PDF. The other method is simply to expand the existing datasets by flipping each training example along its symmetric axis. Locally Adaptive Regression Kernel (LARK) feature is used in this paper because it is robust against illumination changes and noise. Our experimental results demonstrate that an expanded training dataset is not always preferable, even if the expanded dataset includes all original training data.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"45 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126277872","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}
Text representation learning is the cornerstone of solving downstream problems in Natural Language Processing (NLP). However, mining the potential explanatory factors or semantic associations behind data, rather than simply representing the superficial co-occurrence of words, remains a non-trivial challenge. To this end, we seek inspiration from the Quantum Entanglement (QE) which can effectively provide a complete description for the nature of realities and a globally-determined intrinsic correlation of considered objects, thus proposing a novel representation learning hypothesis called the Latent Semantic Correlation (LSC), namely the implicit internal coherence between the semantic space and its corresponding category space. To construct a multi-granularity representation from sememes to words, phrases, sentences, and higher-level LSC, we implement a QE-inspired Network (QEN) under the constraints of quantum formalism and propose the Local Semantic Measurement (LSM) and Extraction (LSE) for effectively capturing probability distribution information from the entangled state of a bipartite quantum system, which has a clear geometrical motivation but also supports a well-founded probabilistic interpretation. Experimental results conducted on several benchmarking classification tasks prove the validity of the LSC hypothesis and the superiority of QEN.
{"title":"Mining Latent Semantic Correlation inspired by Quantum Entanglement","authors":"Zan Li, Yuexian Hou, Tingsan Pan, Tian Tian, Yingjie Gao","doi":"10.1145/3507548.3507598","DOIUrl":"https://doi.org/10.1145/3507548.3507598","url":null,"abstract":"Text representation learning is the cornerstone of solving downstream problems in Natural Language Processing (NLP). However, mining the potential explanatory factors or semantic associations behind data, rather than simply representing the superficial co-occurrence of words, remains a non-trivial challenge. To this end, we seek inspiration from the Quantum Entanglement (QE) which can effectively provide a complete description for the nature of realities and a globally-determined intrinsic correlation of considered objects, thus proposing a novel representation learning hypothesis called the Latent Semantic Correlation (LSC), namely the implicit internal coherence between the semantic space and its corresponding category space. To construct a multi-granularity representation from sememes to words, phrases, sentences, and higher-level LSC, we implement a QE-inspired Network (QEN) under the constraints of quantum formalism and propose the Local Semantic Measurement (LSM) and Extraction (LSE) for effectively capturing probability distribution information from the entangled state of a bipartite quantum system, which has a clear geometrical motivation but also supports a well-founded probabilistic interpretation. Experimental results conducted on several benchmarking classification tasks prove the validity of the LSC hypothesis and the superiority of QEN.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127757912","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}
This paper takes visitor experience as the center to study the specific strategies to enhance the digital display effect of the former residence Memorial Hall, in order to deal with the plight of its digital display development lag. Based on the theory of IPOP, this paper makes an empirical study of Tsou Jung Memorial Hall through questionnaire survey and field observation, this paper discusses the differences of four kinds of audience on the digital display of the former residence Memorial Hall. There are significant differences and correlations among the four kinds of experiences dimensions among the audiences with different preference types. Through the analysis of their internal relations, this paper explores the application possibility of IPOP theory in the digital display experience of museums, it provides a general plan for the evaluation of demonstration effect and the standard of technology application.
{"title":"Research on Digital Exhibition Design of Former Residence Memorial Hall based on IPOP Theory","authors":"Xia Wang, Zhengqing Jiang","doi":"10.1145/3507548.3507606","DOIUrl":"https://doi.org/10.1145/3507548.3507606","url":null,"abstract":"This paper takes visitor experience as the center to study the specific strategies to enhance the digital display effect of the former residence Memorial Hall, in order to deal with the plight of its digital display development lag. Based on the theory of IPOP, this paper makes an empirical study of Tsou Jung Memorial Hall through questionnaire survey and field observation, this paper discusses the differences of four kinds of audience on the digital display of the former residence Memorial Hall. There are significant differences and correlations among the four kinds of experiences dimensions among the audiences with different preference types. Through the analysis of their internal relations, this paper explores the application possibility of IPOP theory in the digital display experience of museums, it provides a general plan for the evaluation of demonstration effect and the standard of technology application.","PeriodicalId":414908,"journal":{"name":"Proceedings of the 2021 5th International Conference on Computer Science and Artificial Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130280681","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
扫码关注我们
求助内容：
应助结果提醒方式：