Matches in ScholarlyData for { ?s ?p ?o. }
- dynamic-learning-based-mechanism-design-for-depend sameAs dynamic-learning-based-mechanism-design-for-depend.
- dynamic-learning-based-mechanism-design-for-depend abstract "Learning private information from multiple strategic agents poses challenge in many Internet applications. Sponsored search auctions, crowdsourcing, Amazon's mechanical turk, various online review forums are examples where we are interested in learning true values of the advertisers or true opinion of the reviewers. The common thread in these decision problems is that the optimal outcome depends on the private information of all the agents, while the decision of the outcome can be chosen only through reported information which may be manipulated by the strategic agents. The other important trait of these applications is their dynamic nature. The advertisers in an online auction or the users of mechanical turk arrive and depart, and when present, interact with the system repeatedly, giving the opportunity to learn their types. Dynamic mechanisms, which learn from the past interactions and make present decisions depending on the expected future evolution of the game, has been shown to improve performance over repeated versions of static mechanisms. In this paper, we will survey the past and current state-of-the-art dynamic mechanisms and analyze a new setting where the agents consist of buyers and sellers, known as exchange economies, and agents having value interdependency, which are relevant in applications illustrated through examples. We show that known results of dynamic mechanisms with independent value settings cannot guarantee certain desirable properties in this new significantly different setting. In the future work, we propose to analyze similar settings with dynamic types and population.".
- dynamic-learning-based-mechanism-design-for-depend hasAuthorList authorList.
- dynamic-learning-based-mechanism-design-for-depend hasTopic web-context-economy.
- dynamic-learning-based-mechanism-design-for-depend hasTopic World_Wide_Web.
- dynamic-learning-based-mechanism-design-for-depend isPartOf proceedings.
- dynamic-learning-based-mechanism-design-for-depend title "Dynamic Learning-Based Mechanism Design for Dependent Valued Exchange Economies".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent swaprava-nath.
- fuzzy-associative-rule-based-approach-for-pattern- creator ashish-mangalampalli.
- fuzzy-associative-rule-based-approach-for-pattern- type InProceedings.
- fuzzy-associative-rule-based-approach-for-pattern- label "Fuzzy Associative Rule-Based Approach for Pattern Mining and Identification and Pattern-Based Classification".
- fuzzy-associative-rule-based-approach-for-pattern- sameAs fuzzy-associative-rule-based-approach-for-pattern-.
- fuzzy-associative-rule-based-approach-for-pattern- abstract "Associative Classification leverages Association Rule Mining (ARM) to train Rule-based classifiers. The classifiers are built on high quality Association Rules mined from the given dataset. Associative Classifiers are very accurate because Association Rules encapsulate all the dominant and statistically significant relationships between items in the dataset. They are also very robust as noise in the form of insignificant and low-frequency itemsets are eliminated during the mining and training stages. Moreover, the rules are easy-to-comprehend, thus making the classifier transparent. Conventional Associative Classification and Association Rule Mining (ARM) algorithms are inherently designed to work only with binary attributes, and expect any quantitative attributes to be converted to binary ones using ranges, like Age = [25, 60] . In order to mitigate this constraint, Fuzzy logic is used to convert quantitative attributes to fuzzy binary attributes, like Age = Middle-aged , so as to eliminate any loss of information arising due to sharp partitioning, especially at partition boundaries, and then generate Fuzzy Association Rules using an appropriate Fuzzy ARM algorithm. These Fuzzy Association Rules can then be used to train a Fuzzy Associative Classifier. In this paper, we also show how Fuzzy Associative Classifiers so built can be used in a wide variety of domains and datasets, like transactional datasets and image datasets.".
- fuzzy-associative-rule-based-approach-for-pattern- hasAuthorList authorList.
- fuzzy-associative-rule-based-approach-for-pattern- hasTopic web-context-economy.
- fuzzy-associative-rule-based-approach-for-pattern- hasTopic World_Wide_Web.
- fuzzy-associative-rule-based-approach-for-pattern- isPartOf proceedings.
- fuzzy-associative-rule-based-approach-for-pattern- title "Fuzzy Associative Rule-Based Approach for Pattern Mining and Identification and Pattern-Based Classification".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent ashish-mangalampalli.
- measurement-and-analysis-of-cyberlocker-services creator aniket-mahanti.
- measurement-and-analysis-of-cyberlocker-services type InProceedings.
- measurement-and-analysis-of-cyberlocker-services label "Measurement and Analysis of Cyberlocker Services".
- measurement-and-analysis-of-cyberlocker-services sameAs measurement-and-analysis-of-cyberlocker-services.
- measurement-and-analysis-of-cyberlocker-services abstract "Cyberlocker Services (CLS) such as RapidShare and Megaupload have recently become popular. The decline of Peer-to-Peer (P2P) file sharing has prompted various services including CLS to replace it. We propose a comprehensive multi-level characterization of the CLS ecosystem. We answer three research questions: (a) what is a suitable measurement infrastructure for gathering CLS workloads; (b) what are the characteristics of the CLS ecosystem; and (c) what are the implications of CLS on Web 2.0 (and the Internet). To the best of our knowledge, this work is the first to characterize the CLS ecosystem. The work will highlight the content, usage, performance, infrastructure, quality of service, and evolution characteristics of CLS.".
- measurement-and-analysis-of-cyberlocker-services hasAuthorList authorList.
- measurement-and-analysis-of-cyberlocker-services hasTopic agents-grids-and-services.
- measurement-and-analysis-of-cyberlocker-services hasTopic World_Wide_Web.
- measurement-and-analysis-of-cyberlocker-services isPartOf proceedings.
- measurement-and-analysis-of-cyberlocker-services title "Measurement and Analysis of Cyberlocker Services".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent aniket-mahanti.
- performance-enhancement-of-scheduling-algorithms-i creator hemant-kumar-mehta.
- performance-enhancement-of-scheduling-algorithms-i creator manohar-chandwani.
- performance-enhancement-of-scheduling-algorithms-i creator priyesh-kanungo.
- performance-enhancement-of-scheduling-algorithms-i type InProceedings.
- performance-enhancement-of-scheduling-algorithms-i label "Performance Enhancement of Scheduling Algorithms in Clusters and Grids Using Improved Dynamic Load Balancing Techniques".
- performance-enhancement-of-scheduling-algorithms-i sameAs performance-enhancement-of-scheduling-algorithms-i.
- performance-enhancement-of-scheduling-algorithms-i abstract "This paper describes the research work done for during PhD study. Cluster computing, grid computing and cloud computing are distributed computing environments (DCEs) widely accepted for the next generation Web based commercial and scientific applications. These applications work around the globally distributed data of petabyte scale that can only be processed by the aggregating the capability of globally distributed resources. The resource management and process scheduling in large scale distributed computing environment are a challenging task. In this research work we have devised new scheduling algorithms and resource management strategies specially designed for the cluster and grid cloud and peer-to-peer computing. The research work finally presented the distributed computing solutions to one scientific and one commercial application viz. e-Learning and data mining.".
- performance-enhancement-of-scheduling-algorithms-i hasAuthorList authorList.
- performance-enhancement-of-scheduling-algorithms-i hasTopic agents-grids-and-services.
- performance-enhancement-of-scheduling-algorithms-i hasTopic World_Wide_Web.
- performance-enhancement-of-scheduling-algorithms-i isPartOf proceedings.
- performance-enhancement-of-scheduling-algorithms-i title "Performance Enhancement of Scheduling Algorithms in Clusters and Grids Using Improved Dynamic Load Balancing Techniques".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent hemant-kumar-mehta.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent priyesh-kanungo.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent manohar-chandwani.
- item-3 previous item-2.
- ranked-answer-graph-construction-for-keyword-queri creator dominic-damien.
- ranked-answer-graph-construction-for-keyword-queri creator k-parthasarathy.
- ranked-answer-graph-construction-for-keyword-queri creator p-kumar-sreenivasa.
- ranked-answer-graph-construction-for-keyword-queri type InProceedings.
- ranked-answer-graph-construction-for-keyword-queri label "Ranked Answer Graph Construction for Keyword Queries on RDF Graphs without Distance Neighbourhood Restriction".
- ranked-answer-graph-construction-for-keyword-queri sameAs ranked-answer-graph-construction-for-keyword-queri.
- ranked-answer-graph-construction-for-keyword-queri abstract "Abstract--- RDF and RDFS have recently become very popular as frameworks for representing data and meta-data in form of a domain description, respectively. RDF data can also be thought of as graph data. In this paper, we focus on keyword-based querying of RDF data. In the existing approaches for answering such keyword queries, keywords are mapped to nodes in the graph and their neighborhoods are explored to extract subgraph(s) of the data graph that contain(s) information relevant to the query. In order to restrict the computational effort, a fixed distance bound is used to define the neighborhoods of nodes. In this paper we present an elegant algorithm for keyword query processing on RDF data that does not assume such a fixed bound. The approach adopts a pruned exploration mechanism where closely related nodes are identified, subgraphs are pruned and joined using suitable hook nodes. The system dynamically manages the distance depending on the closeness between the keywords. The working of the algorithm is illustrated using a fragment of AIFB institute data represented as an RDF graph.".
- ranked-answer-graph-construction-for-keyword-queri hasAuthorList authorList.
- ranked-answer-graph-construction-for-keyword-queri hasTopic semantic-web.
- ranked-answer-graph-construction-for-keyword-queri hasTopic World_Wide_Web.
- ranked-answer-graph-construction-for-keyword-queri isPartOf proceedings.
- ranked-answer-graph-construction-for-keyword-queri title "Ranked Answer Graph Construction for Keyword Queries on RDF Graphs without Distance Neighbourhood Restriction".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent k-parthasarathy.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent p-kumar-sreenivasa.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent dominic-damien.