The information leakage problem often exists in bidirectional quantum secure direct communication or quantum dialogue. In this work, we find that this problem also exists in the one-way quantum secure communication pr...The information leakage problem often exists in bidirectional quantum secure direct communication or quantum dialogue. In this work, we find that this problem also exists in the one-way quantum secure communication protocol [Chin. Phys. Lett. 32 （2015） 050301]. Specifically, the first bit of every four-bit message block is leaked out without awareness. A way to improve the information leakage problem is given.展开更多
From a data mining perspective, sequence classification is to build a classifier using frequent sequential patterns. However, mining for a complete set of sequential patterns on a large dataset can be extremely time-c...From a data mining perspective, sequence classification is to build a classifier using frequent sequential patterns. However, mining for a complete set of sequential patterns on a large dataset can be extremely time-consuming and the large number of patterns discovered also makes the pattern selection and classifier building very time-consuming. The fact is that, in sequence classification, it is much more important to discover discriminative patterns than a complete pattern set. In this paper, we propose a novel hierarchical algorithm to build sequential classifiers using discriminative sequential patterns. Firstly, we mine for the sequential patterns which axe the most strongly correlated to each target class. In this step, an aggressive strategy is employed to select a small set of sequential patterns. Secondly, pattern pruning and serial coverage test are done on the mined patterns. The patterns that pass the serial test are used to build the sub-classifier at the first level of the final classifier. And thirdly, the training samples that cannot be covered are fed back to the sequential pattern mining stage with updated parameters. This process continues until predefined interestingness measure thresholds are reached, or all samples axe covered. The patterns generated in each loop form the sub-classifier at each level of the final classifier. Within this framework, the searching space can be reduced dramatically while a good classification performance is achieved. The proposed algorithm is tested in a real-world business application for debt prevention in social security area. The novel sequence classification algorithm shows the effectiveness and efficiency for predicting debt occurrences based on customer activity sequence data.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos 61502101 and 61170321the Natural Science Foundation of Jiangsu Province under Grant No BK20140651+1 种基金Funded by PAPDCICAEET
文摘The information leakage problem often exists in bidirectional quantum secure direct communication or quantum dialogue. In this work, we find that this problem also exists in the one-way quantum secure communication protocol [Chin. Phys. Lett. 32 （2015） 050301]. Specifically, the first bit of every four-bit message block is leaked out without awareness. A way to improve the information leakage problem is given.
基金supported by Australian Research Council Linkage Project under Grant No. LP0775041the Early Career Researcher Grant under Grant No. 2007002448 from University of Technology, Sydney, Australia
文摘From a data mining perspective, sequence classification is to build a classifier using frequent sequential patterns. However, mining for a complete set of sequential patterns on a large dataset can be extremely time-consuming and the large number of patterns discovered also makes the pattern selection and classifier building very time-consuming. The fact is that, in sequence classification, it is much more important to discover discriminative patterns than a complete pattern set. In this paper, we propose a novel hierarchical algorithm to build sequential classifiers using discriminative sequential patterns. Firstly, we mine for the sequential patterns which axe the most strongly correlated to each target class. In this step, an aggressive strategy is employed to select a small set of sequential patterns. Secondly, pattern pruning and serial coverage test are done on the mined patterns. The patterns that pass the serial test are used to build the sub-classifier at the first level of the final classifier. And thirdly, the training samples that cannot be covered are fed back to the sequential pattern mining stage with updated parameters. This process continues until predefined interestingness measure thresholds are reached, or all samples axe covered. The patterns generated in each loop form the sub-classifier at each level of the final classifier. Within this framework, the searching space can be reduced dramatically while a good classification performance is achieved. The proposed algorithm is tested in a real-world business application for debt prevention in social security area. The novel sequence classification algorithm shows the effectiveness and efficiency for predicting debt occurrences based on customer activity sequence data.
