Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For decades, the crowdsourcing has gained much attention from both academia and industry, which outsources a number of tasks to human workers. Existing works considered improving the task accuracy through voting or learning methods, they usually did not fully take into account reducing the latency of the task completion. When a task requester posts a group of tasks (e.g., sentiment analysis), and one can only obtain ansrs of all tasks after the last task is accomplished. As a consequence, the time delay of even one task in this group could delay the next step of the task requester's work from minutes to days, which is quite undesirable for the task requester. #R##N#Inspired by the importance of the task accuracy and latency, in this paper,  will propose a novel crowdsourcing framework, namely Fast and Reliable crOwdsourcinG framework (FROG), which intelligently assigns tasks to workers, such that the latencies of tasks are reduced and the expected accuracies of tasks are met. Specifically, our FROG framework consists of two important components, task scheduler and notification modules. For the task scheduler module,  formalize a FROG task scheduling (FROG-TS) problem, in which the server actively assigns workers with tasks with high reliability and low latency.  prove that the FROG-TS problem is NP-hard. Thus,  design two heuristic approaches, request-based and batch-based scheduling. For the notification module,  define an efficient worker notifying (EWN) problem, which only sends task invitations to those workers with high probabilities of accepting the tasks. To tackle the EWN problem,  propose a smooth kernel density estimation approach to estimate the probability that a worker accepts the task invitation. Through extensive experiments,  demonstrate the effectiveness and efficiency of our proposed FROG platform on both real and synthetic data sets.
['Peng Cheng', 'Xiang Lian', 'Xun Jian', 'Lei Chen']
I am writing a research paper on a idea FROG: A Fast and Reliable Crowdsourcing Framework (Technical Report)
[{"from": "human", "value": "I am writing a research paper on a idea FROG: A Fast and Reliable Crowdsourcing Framework (Technical Report)"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: For decades, the crowdsourcing has gained much attention from both academia and industry, which outsources a number of tasks to human workers. Existing works considered improving the task accuracy through voting or learning methods, they usually did not fully take into account reducing the latency of the task completion. When a task requester posts a group of tasks (e.g., sentiment analysis), and one can only obtain ansrs of all tasks after the last task is accomplished. As a consequence, the time delay of even one task in this group could delay the next step of the task requester's work from minutes to days, which is quite undesirable for the task requester. #R##N#Inspired by the importance of the task accuracy and latency, in this paper,  will propose a novel crowdsourcing framework, namely Fast and Reliable crOwdsourcinG framework (FROG), which intelligently assigns tasks to workers, such that the latencies of tasks are reduced and the expected accuracies of tasks are met. Specifically, our FROG framework consists of two important components, task scheduler and notification modules. For the task scheduler module,  formalize a FROG task scheduling (FROG-TS) problem, in which the server actively assigns workers with tasks with high reliability and low latency.  prove that the FROG-TS problem is NP-hard. Thus,  design two heuristic approaches, request-based and batch-based scheduling. For the notification module,  define an efficient worker notifying (EWN) problem, which only sends task invitations to those workers with high probabilities of accepting the tasks. To tackle the EWN problem,  propose a smooth kernel density estimation approach to estimate the probability that a worker accepts the task invitation. Through extensive experiments,  demonstrate the effectiveness and efficiency of our proposed FROG platform on both real and synthetic data sets."}]