Qing Wang
Qing Wang has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
Chunqiu Zeng
School of Computing and Information Sciences, Florida International University, Miami, FL, USA
5 shared publicationsTao Li
School of Computing and Information Sciences, Florida International University, Miami, FL, USA
5 shared publicationsLarisa Shwartz
Cognitive Service Foundations, IBM T.J. Watson Research Center, Yorktown Heights, NY, USA
4 shared publicationsGenady Ya. Grabarnik
Dept. Math & Computer Science, St. John’s University, Queens, NY, USA
3 shared publications- Qifeng Zhou
School of Aerospace Engineering, Xiamen University, Xiamen, China
3 shared publications - Larisa Shwartz
IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
2 shared publications
Latest Publications
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 999-1002
GRACE: Generating Cause and Effect of Disaster Sub-Events from Social Media Text
In recent years, social media has emerged as a pivotal source of emergency response for natural disasters. Causal analysis of disaster sub-events is one of crucial concerns. However, the design and implementation of its application scenario present significant challenges, due to the intricate nature of events and information overload. In this work, we introduce GRACE, a system designed for generating the cause and effect of disaster sub-events from social media text. GRACE aims to provide a rapid, comprehensive, and real-time analysis of disaster intelligence. Different from conventional information digestion systems, GRACE employs event evolution reasoning by constructing a causal knowledge graph for disaster sub-events (referred to as DSECG) and fine-tuning GPT-2 on DSECG. This system offers users a comprehensive understanding of disaster events and supports human organizations in enhancing response efforts during disaster situations. Moreover, an online demo is accessible, allowing user interaction with GRACE and providing a visual representation of the cause and effect of disaster sub-events.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 999-1002
Open AccessGRACE: Generating Cause and Effect of Disaster Sub-Events from Social Media Text
In recent years, social media has emerged as a pivotal source of emergency response for natural disasters. Causal analysis of disaster sub-events is one of crucial concerns. However, the design and implementation of its application scenario present significant challenges, due to the intricate nature of events and information overload. In this work, we introduce GRACE, a system designed for generating the cause and effect of disaster sub-events from social media text. GRACE aims to provide a rapid, comprehensive, and real-time analysis of disaster intelligence. Different from conventional information digestion systems, GRACE employs event evolution reasoning by constructing a causal knowledge graph for disaster sub-events (referred to as DSECG) and fine-tuning GPT-2 on DSECG. This system offers users a comprehensive understanding of disaster events and supports human organizations in enhancing response efforts during disaster situations. Moreover, an online demo is accessible, allowing user interaction with GRACE and providing a visual representation of the cause and effect of disaster sub-events.
- 17 March 2023
- Published by Springer Nature
- p. 274-287
Clustering of Bandit with Frequency-Dependent Information Sharing
- 17 March 2023
- Published by Springer Nature
- p. 274-287
Clustering of Bandit with Frequency-Dependent Information Sharing
- 30 May 2021
- Published by Springer Nature
- p. 137-149
Localization of Operational Faults in Cloud Applications by Mining Causal Dependencies in Logs Using Golden Signals
- 30 May 2021
- Published by Springer Nature
- p. 137-149
Localization of Operational Faults in Cloud Applications by Mining Causal Dependencies in Logs Using Golden Signals
- 1 January 2021
- Published by Elsevier in Information Sciences
- Vol. 543, 259-272
Interpretable duplicate question detection models based on attention mechanism
- 1 January 2021
- Published by Elsevier in Information Sciences
- Vol. 543, 259-272
Interpretable duplicate question detection models based on attention mechanism
- 22 October 2019
- Published by Springer Nature
- p. 186-201
Leveraging AI in Service Automation Modeling: From Classical AI Through Deep Learning to Combination Models
- 22 October 2019
- Published by Springer Nature
- p. 186-201
Leveraging AI in Service Automation Modeling: From Classical AI Through Deep Learning to Combination Models
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1875-1884
AISTAR: An Intelligent System for Online IT Ticket Automation Recommendation
An efficient delivery of IT services for increasingly complex IT environments demands an intelligent automated solution for resolving existing and potential issues. An automation recommender system, promptly suggesting the most proper scripted resolution to an arriving IT incident ticket, would play a significant role in IT automation services. Hence, developing a comprehensive framework supporting becomes imperative for continuous improvement of automation recommendation.In this paper, we first identify the challenges of IT services followed by a discussion on AISTAR (an intelligent system for online IT ticket automation recommendation) designed and developed to provide them. Specifically, we define and formalize automation recommendation procedure as a multi-armed bandit problem with dependent arms, which is capable of achieving the optimal tradeoff between exploitation of the system for the best automation recommendation and exploration of automation execution information for future recommendation. Two novel multi-armed bandit models are proposed and integrated to handle the aforementioned challenges in IT automation services. Empirical studies on a large ticket dataset from IBM Global Services demonstrate both the effectiveness and efficiency of our intelligent integrated system. AISTAR is earmarked for Cognitive Event Automation for IBM Service delivery.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1875-1884
AISTAR: An Intelligent System for Online IT Ticket Automation Recommendation
An efficient delivery of IT services for increasingly complex IT environments demands an intelligent automated solution for resolving existing and potential issues. An automation recommender system, promptly suggesting the most proper scripted resolution to an arriving IT incident ticket, would play a significant role in IT automation services. Hence, developing a comprehensive framework supporting becomes imperative for continuous improvement of automation recommendation.In this paper, we first identify the challenges of IT services followed by a discussion on AISTAR (an intelligent system for online IT ticket automation recommendation) designed and developed to provide them. Specifically, we define and formalize automation recommendation procedure as a multi-armed bandit problem with dependent arms, which is capable of achieving the optimal tradeoff between exploitation of the system for the best automation recommendation and exploration of automation execution information for future recommendation. Two novel multi-armed bandit models are proposed and integrated to handle the aforementioned challenges in IT automation services. Empirical studies on a large ticket dataset from IBM Global Services demonstrate both the effectiveness and efficiency of our intelligent integrated system. AISTAR is earmarked for Cognitive Event Automation for IBM Service delivery.
- Open Access
- 14 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 72594-72608
ExTCKNN: Expanding Tree-Based Continuous K Nearest Neighbor Query in Road Networks With Traffic Rules
The existing continuous nearest neighbor query algorithms of moving objects in road networks do not consider any traffic rule and assume that the speed of moving objects is constant and the topology of road networks never change. However, in real road networks, the object’s speed and the road network’s structure change frequently Hence, these would make the existing methods ineffective when applying to the real-world road network environment To overcome the aforementioned disadvantages, we propose a Data Modeling approach of Road Networks with traffic rules (called DMRN R ) and design a novel Expanding Tree-based Continuous k Nearest Neighbors algorithm (abbreviate for ExTCKNN) that can be well adopted to the actual road network environment. The algorithm consists of three steps: 1) it obtains the query results to store using DMRN R in the initial phase; 2) it maintains the data model of road networks by monitoring the real-time change information; and 3) the results are generated according to the submitted query with the updated data model and the latest state of moving objects The merit of the proposed algorithm lies in that it queries the nearest neighbors by taking the movements of the moving object and the variety of the road networks into consideration Extensive experiments are conducted and the experimental results demonstrate a significant improvement of the proposed method when compared with conventional solutions.
- 14 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 72594-72608
Open AccessExTCKNN: Expanding Tree-Based Continuous K Nearest Neighbor Query in Road Networks With Traffic Rules
The existing continuous nearest neighbor query algorithms of moving objects in road networks do not consider any traffic rule and assume that the speed of moving objects is constant and the topology of road networks never change. However, in real road networks, the object’s speed and the road network’s structure change frequently Hence, these would make the existing methods ineffective when applying to the real-world road network environment To overcome the aforementioned disadvantages, we propose a Data Modeling approach of Road Networks with traffic rules (called DMRN R ) and design a novel Expanding Tree-based Continuous k Nearest Neighbors algorithm (abbreviate for ExTCKNN) that can be well adopted to the actual road network environment. The algorithm consists of three steps: 1) it obtains the query results to store using DMRN R in the initial phase; 2) it maintains the data model of road networks by monitoring the real-time change information; and 3) the results are generated according to the submitted query with the updated data model and the latest state of moving objects The merit of the proposed algorithm lies in that it queries the nearest neighbors by taking the movements of the moving object and the variety of the road networks into consideration Extensive experiments are conducted and the experimental results demonstrate a significant improvement of the proposed method when compared with conventional solutions.
- 20 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 31 (8) , 1569-1580
Online Interactive Collaborative Filtering Using Multi-Armed Bandit with Dependent Arms
Online interactive recommender systems strive to promptly suggest to consumers appropriate items according to the current context information. However, such context information is often unavailable in practice. Moreover, the lack of interaction records further worsens the recommendation performance. To address these issues, collaborative filtering (CF) and the online multi-armed bandit mechanisms are adopted in the online interactive recommendation settings, by assuming independent items (i.e., arms). Nonetheless, the assumption rarely holds in reality. In this paper, we study online interactive collaborative filtering problems by considering the dependencies among items. We explicitly formulate the item dependencies as the clusters on arms, where the arms within a single cluster share the similar latent topics. In light of the topic modeling techniques, we come up with a generative model to generate the items from their underlying topics. Furthermore, an efficient online algorithm based on particle learning is developed for inferring both latent parameters and states of our model by taking advantage of the fully adaptive inference strategy of particle learning. Additionally, our inferred model can be naturally integrated with existing multi-armed selection strategies in the online interactive collaborating setting. Empirical studies on two real-world applications demonstrate the effectiveness and efficiency of the proposed approach.
- 20 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 31 (8) , 1569-1580
Online Interactive Collaborative Filtering Using Multi-Armed Bandit with Dependent Arms
Online interactive recommender systems strive to promptly suggest to consumers appropriate items according to the current context information. However, such context information is often unavailable in practice. Moreover, the lack of interaction records further worsens the recommendation performance. To address these issues, collaborative filtering (CF) and the online multi-armed bandit mechanisms are adopted in the online interactive recommendation settings, by assuming independent items (i.e., arms). Nonetheless, the assumption rarely holds in reality. In this paper, we study online interactive collaborative filtering problems by considering the dependencies among items. We explicitly formulate the item dependencies as the clusters on arms, where the arms within a single cluster share the similar latent topics. In light of the topic modeling techniques, we come up with a generative model to generate the items from their underlying topics. Furthermore, an efficient online algorithm based on particle learning is developed for inferring both latent parameters and states of our model by taking advantage of the fully adaptive inference strategy of particle learning. Additionally, our inferred model can be naturally integrated with existing multi-armed selection strategies in the online interactive collaborating setting. Empirical studies on two real-world applications demonstrate the effectiveness and efficiency of the proposed approach.
- 7 May 2018
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 657-665
Online IT Ticket Automation Recommendation Using Hierarchical Multi-armed Bandit Algorithms
The increasing complexity of IT environments urgently requires the use of analytical approaches and automated problem resolution for more efficient delivery of IT services. In this paper, we model the automation recommendation procedure of IT automation services as a contextual bandit problem with dependent arms, where the arms are in the form of hierarchies. Intuitively, different automations in IT automation services, designed to automatically solve the corresponding ticket problems, can be organized into a hierarchy by domain experts according to the types of ticket problems. We introduce a novel hierarchical multi-armed bandit algorithms leveraging the hierarchies, which can match the coarse-to-fine feature space of arms. Empirical experiments on a real large-scale ticket dataset have demonstrated substantial improvements over the conventional bandit algorithms. In addition, a case study of dealing with the cold-start problem is conducted to clearly show the merits of our proposed algorithms.
- 7 May 2018
- Published by Society for Industrial & Applied Mathematics (SIAM)
- p. 657-665
Online IT Ticket Automation Recommendation Using Hierarchical Multi-armed Bandit Algorithms
The increasing complexity of IT environments urgently requires the use of analytical approaches and automated problem resolution for more efficient delivery of IT services. In this paper, we model the automation recommendation procedure of IT automation services as a contextual bandit problem with dependent arms, where the arms are in the form of hierarchies. Intuitively, different automations in IT automation services, designed to automatically solve the corresponding ticket problems, can be organized into a hierarchy by domain experts according to the types of ticket problems. We introduce a novel hierarchical multi-armed bandit algorithms leveraging the hierarchies, which can match the coarse-to-fine feature space of arms. Empirical experiments on a real large-scale ticket dataset have demonstrated substantial improvements over the conventional bandit algorithms. In addition, a case study of dealing with the cold-start problem is conducted to clearly show the merits of our proposed algorithms.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 410-417
Constructing the Knowledge Base for Cognitive IT Service Management
The increasing complexity of IT environments dictates the usage of intelligent automation driven by cognitive technologies, aiming at providing higher quality and more complex services. Inspired by cognitive computing, an integrated framework is proposed for a problem resolution. In order to improve the efficiency of the problem resolution process, it is crucial to formalize problem records and discover relationships between elements of the records, records overall and other technical information. In the proposed framework, the domain knowledge is modeled using ontology. The key contribution of the framework is a novel domain specific approach for extracting useful phrases, that enables an automation improvement through resolution recommendation utilizing the ontology modeling technique. The effectiveness and efficiency of our framework are evaluated by an extensive empirical study of a large scale real ticket data.
- 1 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 410-417
Constructing the Knowledge Base for Cognitive IT Service Management
The increasing complexity of IT environments dictates the usage of intelligent automation driven by cognitive technologies, aiming at providing higher quality and more complex services. Inspired by cognitive computing, an integrated framework is proposed for a problem resolution. In order to improve the efficiency of the problem resolution process, it is crucial to formalize problem records and discover relationships between elements of the records, records overall and other technical information. In the proposed framework, the domain knowledge is modeled using ontology. The key contribution of the framework is a novel domain specific approach for extracting useful phrases, that enables an automation improvement through resolution recommendation utilizing the ontology modeling technique. The effectiveness and efficiency of our framework are evaluated by an extensive empirical study of a large scale real ticket data.