It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm.However,high utility quantitative freq...It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm.However,high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale up.In the context of such needs,we propose a related degree-based frequent pattern mining algorithm,named Related High Utility Quantitative Item set Mining(RHUQI-Miner),to enable the effective mining of railway fault data.The algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees,reducing redundancy and invalid frequent patterns.Subsequently,it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the algorithm.The experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process,thus providing data support for differentiated and precise maintenance strategies.展开更多
People's attitudes towards public events or products may change overtime,rather than staying on the same state.Understanding how sentiments change overtime is an interesting and important problem with many applica...People's attitudes towards public events or products may change overtime,rather than staying on the same state.Understanding how sentiments change overtime is an interesting and important problem with many applications.Given a certain public event or product,a user's sentiments expressed in microblog stream can be regarded as a vector.In this paper,we define a novel problem of sentiment evolution analysis,and develop a simple yet effective method to detect sentiment evolution in user-level for public events.We firstly propose a multidimensional sentiment model with hierarchical structure to model user's complicate sentiments.Based on this model,we use FP-growth tree algorithm to mine frequent sentiment patterns and perform sentiment evolution analysis by Kullback-Leibler divergence.Moreover,we develop an improve Affinity Propagation algorithm to detect why people change their sentiments.Experimental evaluations on real data sets show that sentiment evolution could be implemented effectively using our method proposed in this article.展开更多
基金supported by the Research on Key Technologies and Typical Applications of Big Data in Railway Production and Operation(P2023S006)the Fundamental Research Funds for the Central Universities(2022JBZY023).
文摘It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm.However,high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale up.In the context of such needs,we propose a related degree-based frequent pattern mining algorithm,named Related High Utility Quantitative Item set Mining(RHUQI-Miner),to enable the effective mining of railway fault data.The algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees,reducing redundancy and invalid frequent patterns.Subsequently,it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the algorithm.The experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process,thus providing data support for differentiated and precise maintenance strategies.
基金ACKNOWLEDGEMENTS The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper. The research was supported in part by National Basic Research Program of China （973 Program, No. 2013CB329601, No. 2013CB329604）, National Natural Science Foundation of China （No.91124002, 61372191, 61472433, 61202362, 11301302）, and China Postdoctoral Science Foundation （2013M542560）. All opinions, findings, conclusions and recommendations in this paper are those of the authors and do not necessarily reflect the views of the funding agencies.
文摘People's attitudes towards public events or products may change overtime,rather than staying on the same state.Understanding how sentiments change overtime is an interesting and important problem with many applications.Given a certain public event or product,a user's sentiments expressed in microblog stream can be regarded as a vector.In this paper,we define a novel problem of sentiment evolution analysis,and develop a simple yet effective method to detect sentiment evolution in user-level for public events.We firstly propose a multidimensional sentiment model with hierarchical structure to model user's complicate sentiments.Based on this model,we use FP-growth tree algorithm to mine frequent sentiment patterns and perform sentiment evolution analysis by Kullback-Leibler divergence.Moreover,we develop an improve Affinity Propagation algorithm to detect why people change their sentiments.Experimental evaluations on real data sets show that sentiment evolution could be implemented effectively using our method proposed in this article.
