Guo et al., 2012 - Google Patents
So who won? Dynamic max discovery with the crowdGuo et al., 2012
View PDF- Document ID
- 5803090032624120396
- Author
- Guo S
- Parameswaran A
- Garcia-Molina H
- Publication year
- Publication venue
- Proceedings of the 2012 ACM SIGMOD international conference on management of data
External Links
Snippet
We consider a crowdsourcing database system that may cleanse, populate, or filter its data by using human workers. Just like a conventional DB system, such a crowdsourcing DB system requires data manipulation functions such as select, aggregate, maximum, average …
- 238000007476 Maximum Likelihood 0 description 61
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
- G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce, e.g. shopping or e-commerce
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
- G06Q50/01—Social networking
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Guo et al. | So who won? Dynamic max discovery with the crowd | |
Marcus et al. | Deep reinforcement learning for join order enumeration | |
US20080140641A1 (en) | Knowledge and interests based search term ranking for search results validation | |
Yang et al. | Distance and similarity measures of hesitant fuzzy sets based on Hausdorff metric with applications to multi-criteria decision making and clustering | |
Aziz et al. | Computational social choice: The first ten years and beyond | |
Kou et al. | Crowdsourced top-k queries by confidence-aware pairwise judgments | |
Chai et al. | Incentive-based entity collection using crowdsourcing | |
Wang et al. | Interactive search for one of the top-k | |
Wei et al. | Autoias: Automatic integrated architecture searcher for click-trough rate prediction | |
Tzeng et al. | Massive open online course recommendation system based on a reinforcement learning algorithm | |
Melnikov | Multiheuristic approach to discrete optimization problems | |
Amanatidis et al. | Don’t roll the dice, ask twice: The two-query distortion of matching problems and beyond | |
Naamani-Dery et al. | Preference elicitation for group decisions using the borda voting rule | |
Ilyas et al. | Probabilistic ranking techniques in relational databases | |
Li et al. | Crowdsourced top-k queries by pairwise preference judgments with confidence and budget control | |
US20250117494A1 (en) | Method for prioritizing among vulnerabilities in a software code and a server | |
Li et al. | A solution to the cold-start problem in recommender systems based on social choice theory | |
Zhang et al. | Mac: A probabilistic framework for query answering with machine-crowd collaboration | |
Wang et al. | Interactive mining with ordered and unordered attributes | |
Uprety et al. | Modelling dynamic interactions between relevance dimensions | |
Lin et al. | Reducing Uncertainty of Probabilistic Top-$ k $ Ranking via Pairwise Crowdsourcing | |
Šitum | Analysis of algorithms for determining trust among friends on social networks | |
Zhou et al. | A new information theory-based serendipitous algorithm design | |
Hübner et al. | From cognitive trust theories to computational trust | |
Schvartzman et al. | Exploring large strategy spaces in empirical game modeling |