Haruo Yokota
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Haruo Yokota has a total of 127 co-authors. Here are the top co-authors by number of shared publications:
Yousuke Watanabe
15 shared publications- Hieu Hanh Le
Tokyo Institute of Technology
12 shared publications Dai Kobayashi
Department of Computer Science, Graduate School of Information Science and Engineering, Tokyo Institute of Technology
9 shared publicationsSatoshi Hikida
Department of Computer Science, Tokyo Institute of Technology
7 shared publicationsNobuyoshi Miyazaki
6 shared publicationsShigeki Shibayama
6 shared publications
Latest Publications
- 17 October 2025
- Published by Springer Nature
- p. 248-256
Improving the Efficiency of Interactive Sequential Pattern Mining by Closed Pattern Discovery
- 17 October 2025
- Published by Springer Nature
- p. 248-256
Improving the Efficiency of Interactive Sequential Pattern Mining by Closed Pattern Discovery
- Open Access
- 31 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
- Vol. 4 (1) , 1-28
Methods for Analyzing Medical-Order Sequence Variants in Sequential Pattern Mining for Electronic Medical Record Systems
Electronic medical record systems have been adopted by many large hospitals worldwide, enabling the recorded data to be analyzed by various computer-based techniques to gain a better understanding of hospital-based disease treatments. Among such techniques, sequential pattern mining, already widely used for data mining and knowledge discovery in other application domains, has shown great potential for discovering frequent patterns in sequences of disease treatments. However, studies have yet to evaluate the use of medical-order sequence variants , where a “frequent pattern” can include some limited variations to the pattern, or have considered the factors that lead to these variants. Such a study would be meaningful for medical tasks such as improving the quality of a particular treatment method, comparing treatments with multiple hospitals, recommending the best-suited treatment for each patient, and optimizing the running costs in hospitals. This article proposes methods for evaluating medical-order sequence variants and understanding variant factors based on a statistical approach. We consider the safety and efficiency of sequences and related information about the variants, such as gender, age, and test results from hospitals. Our proposal has been demonstrated as effective by experimentally evaluating an electronic medical record system’s real dataset and obtaining feedback from medical workers. The experimental results indicate that the medical treatment history and specimen test results after hospitalization are significant in identifying the factors that lead to variants.
- 31 January 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing for Healthcare
- Vol. 4 (1) , 1-28
Open AccessMethods for Analyzing Medical-Order Sequence Variants in Sequential Pattern Mining for Electronic Medical Record Systems
Electronic medical record systems have been adopted by many large hospitals worldwide, enabling the recorded data to be analyzed by various computer-based techniques to gain a better understanding of hospital-based disease treatments. Among such techniques, sequential pattern mining, already widely used for data mining and knowledge discovery in other application domains, has shown great potential for discovering frequent patterns in sequences of disease treatments. However, studies have yet to evaluate the use of medical-order sequence variants , where a “frequent pattern” can include some limited variations to the pattern, or have considered the factors that lead to these variants. Such a study would be meaningful for medical tasks such as improving the quality of a particular treatment method, comparing treatments with multiple hospitals, recommending the best-suited treatment for each patient, and optimizing the running costs in hospitals. This article proposes methods for evaluating medical-order sequence variants and understanding variant factors based on a statistical approach. We consider the safety and efficiency of sequences and related information about the variants, such as gender, age, and test results from hospitals. Our proposal has been demonstrated as effective by experimentally evaluating an electronic medical record system’s real dataset and obtaining feedback from medical workers. The experimental results indicate that the medical treatment history and specimen test results after hospitalization are significant in identifying the factors that lead to variants.
- 29 July 2022
- Published by Springer Nature
- p. 117-130
Comparison of Sequence Variants and the Application in Electronic Medical Records
- 29 July 2022
- Published by Springer Nature
- p. 117-130
Comparison of Sequence Variants and the Application in Electronic Medical Records
- Open Access
- 9 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 61046-61064
Recovering Missing Data via Top-k Repeated Patterns for Fuzzy-Based Abnormal Node Detection in Sensor Networks
The stream data acquired by heterogeneous Internet of Things (IoT) sensors are seldom perfect. Most of the collected data streams include either missing or abnormal values caused by various factors such as failure, malfunction, or integrity attacks. Such unreliable data affect the real-time monitoring and compromise the quality of data analysis. By simply analyzing the sensor data via anomaly detection, applications may still be unreliable over the incomplete sensor data streams. Therefore, a reliable method for recovering the missing data and detecting the abnormal ones is indispensable in the IoT environment. This paper presents FuzHD++, a new method to recover missing sensor data and detect abnormal nodes jointly rather than independently. Both elements, data recovery and abnormal node detection, rely on the observed temporal and spatial correlation of sensor data to effectively achieve reliable recovery estimation and detection performance. In the data recovery process, the system adopts a matrix profile to extract the top- $k$ repeated patterns from different sensor nodes. Furthermore, it utilizes the $k$ -nearest neighbor estimator to recover the missing data based on the extracted pattern information of multiple neighbor nodes. During the abnormal node detection process, the system adopts a refined fuzzy rule-based detection method. The refined fuzzy rule-based inference system integrates the expert rules and the rules obtained from sensor data analysis to treat the ambiguity in the decision-making process. We validated the performance of FuzHD++ by comparing it with existing methods using two real-world datasets. Our results showed that the proposed missing sensor data recovery method achieves more than 20% improved root mean square error results than most existing methods. Furthermore, FuzHD++ achieved an average accuracy of 92% for analyzing the sensor readings and detecting the abnormal ones. According to the results, the proposed mechanisms based on the observed temporal and spatial correlation analysis improve the robustness of IoT against data loss and integrity attacks.
- 9 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 61046-61064
Open AccessRecovering Missing Data via Top-k Repeated Patterns for Fuzzy-Based Abnormal Node Detection in Sensor Networks
The stream data acquired by heterogeneous Internet of Things (IoT) sensors are seldom perfect. Most of the collected data streams include either missing or abnormal values caused by various factors such as failure, malfunction, or integrity attacks. Such unreliable data affect the real-time monitoring and compromise the quality of data analysis. By simply analyzing the sensor data via anomaly detection, applications may still be unreliable over the incomplete sensor data streams. Therefore, a reliable method for recovering the missing data and detecting the abnormal ones is indispensable in the IoT environment. This paper presents FuzHD++, a new method to recover missing sensor data and detect abnormal nodes jointly rather than independently. Both elements, data recovery and abnormal node detection, rely on the observed temporal and spatial correlation of sensor data to effectively achieve reliable recovery estimation and detection performance. In the data recovery process, the system adopts a matrix profile to extract the top- $k$ repeated patterns from different sensor nodes. Furthermore, it utilizes the $k$ -nearest neighbor estimator to recover the missing data based on the extracted pattern information of multiple neighbor nodes. During the abnormal node detection process, the system adopts a refined fuzzy rule-based detection method. The refined fuzzy rule-based inference system integrates the expert rules and the rules obtained from sensor data analysis to treat the ambiguity in the decision-making process. We validated the performance of FuzHD++ by comparing it with existing methods using two real-world datasets. Our results showed that the proposed missing sensor data recovery method achieves more than 20% improved root mean square error results than most existing methods. Furthermore, FuzHD++ achieved an average accuracy of 92% for analyzing the sensor readings and detecting the abnormal ones. According to the results, the proposed mechanisms based on the observed temporal and spatial correlation analysis improve the robustness of IoT against data loss and integrity attacks.
- Open Access
- 27 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 135266-135284
A Spatiotemporal and Multivariate Attribute Correlation Extraction Scheme for Detecting Abnormal Nodes in WSNs
Many heterogeneous sensors exhibit a strong correlation in both space and time that can be used to enhance the abnormal node detection problem in a wireless sensor network (WSN). Corruption in these correlations has been shown effective in detecting false data injection attacks. However, extracting such correlations is considered a challenging task in WSNs. In this paper, we adopt a new cross-correlation-based method to extract the sensor relationships. It utilizes the observed spatiotemporal (ST) and multivariate-attribute (MVA) sensor correlations to decide whether the sensor is subject to abnormalities or represents actual events. Based on the ST correlations, the cross-correlation is extracted in both space and time by conducting shape-based logical subclustering and two-phase analysis methods. In the first analysis phase, the system uses a variable-size sliding window and a median absolute deviation (MAD) measure. If the collected sensor data streams output a certain percentage of anomalous points, the MAD will flag these points as anomalous measurements, and all the sensor data and the window size will be passed to the second analysis phase. The latter performs both tumbling-window and sliding-window analyses to extract multicriteria cross-correlation measures. Finally, all the extracted sensor time-series features will be fed to the shape-based clustering to generate a sensor similarity-like graph. The latter reflects the similarity degree of the sensor with the other nodes. The nodes with a low similarity degree below the threshold will be identified as candidate abnormal nodes. Based on the observed MVA correlations, a set consisting of a few rules is introduced to check whether the detected candidate abnormal nodes represent actual events. Finally, if abnormal nodes exist, then such nodes are reported. Our experiments using two real-world datasets demonstrate that our proposed approach detects abnormal nodes with an average accuracy of 96.50%, an average precision of 88.69%, and a recall rate of 93.00%.
- 27 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 135266-135284
Open AccessA Spatiotemporal and Multivariate Attribute Correlation Extraction Scheme for Detecting Abnormal Nodes in WSNs
Many heterogeneous sensors exhibit a strong correlation in both space and time that can be used to enhance the abnormal node detection problem in a wireless sensor network (WSN). Corruption in these correlations has been shown effective in detecting false data injection attacks. However, extracting such correlations is considered a challenging task in WSNs. In this paper, we adopt a new cross-correlation-based method to extract the sensor relationships. It utilizes the observed spatiotemporal (ST) and multivariate-attribute (MVA) sensor correlations to decide whether the sensor is subject to abnormalities or represents actual events. Based on the ST correlations, the cross-correlation is extracted in both space and time by conducting shape-based logical subclustering and two-phase analysis methods. In the first analysis phase, the system uses a variable-size sliding window and a median absolute deviation (MAD) measure. If the collected sensor data streams output a certain percentage of anomalous points, the MAD will flag these points as anomalous measurements, and all the sensor data and the window size will be passed to the second analysis phase. The latter performs both tumbling-window and sliding-window analyses to extract multicriteria cross-correlation measures. Finally, all the extracted sensor time-series features will be fed to the shape-based clustering to generate a sensor similarity-like graph. The latter reflects the similarity degree of the sensor with the other nodes. The nodes with a low similarity degree below the threshold will be identified as candidate abnormal nodes. Based on the observed MVA correlations, a set consisting of a few rules is introduced to check whether the detected candidate abnormal nodes represent actual events. Finally, if abnormal nodes exist, then such nodes are reported. Our experiments using two real-world datasets demonstrate that our proposed approach detects abnormal nodes with an average accuracy of 96.50%, an average precision of 88.69%, and a recall rate of 93.00%.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 289-298
Hierarchical Abnormal-Node Detection Using Fuzzy Logic for ECA Rule-Based Wireless Sensor Networks
The Internet of things (IoT) is a distributed, networked system composed of many embedded sensor devices. Unfortunately, these devices are resource constrained and susceptible to malicious data-integrity attacks and failures, leading to unreliability and sometimes to major failure of parts of the entire system. Intrusion detection and failure handling are essential requirements for IoT security. Nevertheless, as far as we know, the area of data-integrity detection for IoT has yet to receive much attention. Most previous intrusion-detection methods proposed for IoT, particularly for wireless sensor networks (WSNs), focus only on specific types of network attacks. Moreover, these approaches usually rely on using precise values to specify abnormality thresholds. However, sensor readings are often imprecise and crisp threshold values are inappropriate. To guarantee a lightweight, dependable monitoring system, we propose a novel hierarchical framework for detecting abnormal nodes in WSNs. The proposed approach uses fuzzy logic in event-condition-action (ECA) rule-based WSNs to detect malicious nodes, while also considering failed nodes. The spatiotemporal semantics of heterogeneous sensor readings are considered in the decision process to distinguish malicious data from other anomalies. Following our experiments with the proposed framework, we stress the significance of considering the sensor correlations to achieve detection accuracy, which has been neglected in previous studies. Our experiments using real-world sensor data demonstrate that our approach can provide high detection accuracy with low false-alarm rates. We also show that our approach performs well when compared to two well-known classification algorithms.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 289-298
Hierarchical Abnormal-Node Detection Using Fuzzy Logic for ECA Rule-Based Wireless Sensor Networks
The Internet of things (IoT) is a distributed, networked system composed of many embedded sensor devices. Unfortunately, these devices are resource constrained and susceptible to malicious data-integrity attacks and failures, leading to unreliability and sometimes to major failure of parts of the entire system. Intrusion detection and failure handling are essential requirements for IoT security. Nevertheless, as far as we know, the area of data-integrity detection for IoT has yet to receive much attention. Most previous intrusion-detection methods proposed for IoT, particularly for wireless sensor networks (WSNs), focus only on specific types of network attacks. Moreover, these approaches usually rely on using precise values to specify abnormality thresholds. However, sensor readings are often imprecise and crisp threshold values are inappropriate. To guarantee a lightweight, dependable monitoring system, we propose a novel hierarchical framework for detecting abnormal nodes in WSNs. The proposed approach uses fuzzy logic in event-condition-action (ECA) rule-based WSNs to detect malicious nodes, while also considering failed nodes. The spatiotemporal semantics of heterogeneous sensor readings are considered in the decision process to distinguish malicious data from other anomalies. Following our experiments with the proposed framework, we stress the significance of considering the sensor correlations to achieve detection accuracy, which has been neglected in previous studies. Our experiments using real-world sensor data demonstrate that our approach can provide high detection accuracy with low false-alarm rates. We also show that our approach performs well when compared to two well-known classification algorithms.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 568-575
Abnormal-Node Detection Based on Spatio-Temporal and Multivariate-Attribute Correlation in Wireless Sensor Networks
In wireless sensor networks (WSNs), data can be subject to malicious attacks and failures, leading to unreliability. This vulnerability poses a challenge to environmental monitoring applications by creating false alarms. To guarantee a trustworthy system, we therefore need to detect abnormal nodes. In this paper, we propose a new framework for detecting abnormal nodes in clustered heterogeneous WSNs. It makes use of observed spatiotemporal (ST) and multivariate-attribute (MVA) sensor correlations, while considering the background knowledge of the monitored environment. Based on the ST correlations, the collected data is analyzed by computing the crosscorrelation between sensor streams. A new method is proposed for evaluating the intensity of the correlation between two sensor streams. The crosscorrelation value obtained is compared against two thresholds, the lag threshold and the correlation threshold. Based on available background knowledge and the observed MVA correlations, a number of rules are presented to detect abnormal nodes while identifying real events. Our experiments on real-world sensor data demonstrate that our approach captures the correlation and discovers abnormal nodes efficiently.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 568-575
Abnormal-Node Detection Based on Spatio-Temporal and Multivariate-Attribute Correlation in Wireless Sensor Networks
In wireless sensor networks (WSNs), data can be subject to malicious attacks and failures, leading to unreliability. This vulnerability poses a challenge to environmental monitoring applications by creating false alarms. To guarantee a trustworthy system, we therefore need to detect abnormal nodes. In this paper, we propose a new framework for detecting abnormal nodes in clustered heterogeneous WSNs. It makes use of observed spatiotemporal (ST) and multivariate-attribute (MVA) sensor correlations, while considering the background knowledge of the monitored environment. Based on the ST correlations, the collected data is analyzed by computing the crosscorrelation between sensor streams. A new method is proposed for evaluating the intensity of the correlation between two sensor streams. The crosscorrelation value obtained is compared against two thresholds, the lag threshold and the correlation threshold. Based on available background knowledge and the observed MVA correlations, a number of rules are presented to detect abnormal nodes while identifying real events. Our experiments on real-world sensor data demonstrate that our approach captures the correlation and discovers abnormal nodes efficiently.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-165
VENUS: Verifiable range query in data streaming
Internet of Things (IoT) devices have gained the popularity in our daily life. As IoT devices are usually resource-constrained, the sensed data cannot be kept in the local memory and need to be outsourced to the cloud in a streaming manner. However, the untrusted cloud might return the falsified answer to the query made by the user. Verifiable data outsourcing addresses the similar problem, but the design challenge here mainly comes with the fact that the user can only have the vision on a single data at any time slot. In this paper, we propose VENUS to achieve verifiable range query in data streaming. In particular, VENUS ensures data confidentiality and query answer integrity of the range query in the data streaming, by taking advantage of our proposed flexible and authenticated data structure HPBTree. The simulation and analytical results demonstrate the efficiency and effectiveness of VENUS.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-165
VENUS: Verifiable range query in data streaming
Internet of Things (IoT) devices have gained the popularity in our daily life. As IoT devices are usually resource-constrained, the sensed data cannot be kept in the local memory and need to be outsourced to the cloud in a streaming manner. However, the untrusted cloud might return the falsified answer to the query made by the user. Verifiable data outsourcing addresses the similar problem, but the design challenge here mainly comes with the fact that the user can only have the vision on a single data at any time slot. In this paper, we propose VENUS to achieve verifiable range query in data streaming. In particular, VENUS ensures data confidentiality and query answer integrity of the range query in the data streaming, by taking advantage of our proposed flexible and authenticated data structure HPBTree. The simulation and analytical results demonstrate the efficiency and effectiveness of VENUS.
- 1 January 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E101.D (1) , 152-170
Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node
Many concurrency control protocols for B-trees use latch-coupling because its execution is efficient on a single machine. Some studies have indicated that latch-coupling may involve a performance bottleneck when using multicore processors in a shared-everything environment, but no studies have considered the possible performance bottleneck caused by sending messages between processing elements (PEs) in shared-nothing environments. We propose two new concurrency control protocols, “LCFB” and “LCFB-link”, which require no latch-coupling in optimistic processes. The LCFB-link also innovates B-link approach within each PE to reduce the cost of modifications in the PE, as a solution to the difficulty of consistency management for the side pointers in a parallel B-tree. The B-link algorithm is well known as a protocol without latch-coupling, but B-link has the difficulty of guaranteeing the consistency of the side pointers in a parallel B-tree. Experimental results in various environments indicated that the system throughput of the proposed protocols was always superior to those of the conventional protocols, particularly in large-scale configurations, and using LCFB-link was effective for higher update ratios. In addition, to mitigate access skew, data should migrate between PEs. We have demonstrated that our protocols always improve the system throughput and are effective as concurrency controls for data migration.
- 1 January 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E101.D (1) , 152-170
Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node
Many concurrency control protocols for B-trees use latch-coupling because its execution is efficient on a single machine. Some studies have indicated that latch-coupling may involve a performance bottleneck when using multicore processors in a shared-everything environment, but no studies have considered the possible performance bottleneck caused by sending messages between processing elements (PEs) in shared-nothing environments. We propose two new concurrency control protocols, “LCFB” and “LCFB-link”, which require no latch-coupling in optimistic processes. The LCFB-link also innovates B-link approach within each PE to reduce the cost of modifications in the PE, as a solution to the difficulty of consistency management for the side pointers in a parallel B-tree. The B-link algorithm is well known as a protocol without latch-coupling, but B-link has the difficulty of guaranteeing the consistency of the side pointers in a parallel B-tree. Experimental results in various environments indicated that the system throughput of the proposed protocols was always superior to those of the conventional protocols, particularly in large-scale configurations, and using LCFB-link was effective for higher update ratios. In addition, to mitigate access skew, data should migrate between PEs. We have demonstrated that our protocols always improve the system throughput and are effective as concurrency controls for data migration.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1726-1731
Fast Generation of Clinical Pathways including Time Intervals in Sequential Pattern Mining on Electronic Medical Record Systems
Machine-based generation of clinical pathways that utilizes sequential pattern mining to extract the pathways from historical electronic medical record (EMR) systems has gained much attention. We previously proposed a method to generate clinical pathways including time intervals that provides rich information to medical workers. However, this method is difficult to use in real applications because of slow clinical pathway generation as a large number of duplicate patterns are included. In this paper, to speed up the clinical pathway generation, we deploy an occurrence check that adds only closed sequential patterns to the results during mining while considering time intervals between events. Experiments on real data sets showed that our proposal can be more than 13 times faster than our earlier method and can significantly improve the decision-making process for medical actions at large hospitals.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1726-1731
Fast Generation of Clinical Pathways including Time Intervals in Sequential Pattern Mining on Electronic Medical Record Systems
Machine-based generation of clinical pathways that utilizes sequential pattern mining to extract the pathways from historical electronic medical record (EMR) systems has gained much attention. We previously proposed a method to generate clinical pathways including time intervals that provides rich information to medical workers. However, this method is difficult to use in real applications because of slow clinical pathway generation as a large number of duplicate patterns are included. In this paper, to speed up the clinical pathway generation, we deploy an occurrence check that adds only closed sequential patterns to the results during mining while considering time intervals between events. Experiments on real data sets showed that our proposal can be more than 13 times faster than our earlier method and can significantly improve the decision-making process for medical actions at large hospitals.