Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Hardness of approximation). Showing records 1 – 12 of 12 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Alberta

1. Khani, Mohammad Reza. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.

Degree: MS, Department of Computing Science, 2011, University of Alberta

 In this thesis we provide improved approximation algorithms for the Min-Max k-Tree Cover, Bounded Tree Cover and Shallow-Light k-Steiner Tree, (k, 2)-subgraph problems. In Chapter… (more)

Subjects/Keywords: Theory of Computation; Approximation Algorithms; CombinatorialOptimization; Hardness of Approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Khani, M. R. (2011). Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cbr86b369q

Chicago Manual of Style (16th Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Masters Thesis, University of Alberta. Accessed April 06, 2020. https://era.library.ualberta.ca/files/cbr86b369q.

MLA Handbook (7th Edition):

Khani, Mohammad Reza. “Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph.” 2011. Web. 06 Apr 2020.

Vancouver:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Internet] [Masters thesis]. University of Alberta; 2011. [cited 2020 Apr 06]. Available from: https://era.library.ualberta.ca/files/cbr86b369q.

Council of Science Editors:

Khani MR. Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph. [Masters Thesis]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/cbr86b369q

2. Briest, Patrick. Computational aspects of combinatorial pricing problems.

Degree: 2007, Technische Universität Dortmund

 Combinatorial pricing encompasses a wide range of natural optimization problems that arise in the computation of revenue maximizing pricing schemes for a given set of… (more)

Subjects/Keywords: algorithmic game theory; approximation algorithms; hardness of approximation; pricing; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Briest, P. (2007). Computational aspects of combinatorial pricing problems. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/24877

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Thesis, Technische Universität Dortmund. Accessed April 06, 2020. http://hdl.handle.net/2003/24877.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Briest, Patrick. “Computational aspects of combinatorial pricing problems.” 2007. Web. 06 Apr 2020.

Vancouver:

Briest P. Computational aspects of combinatorial pricing problems. [Internet] [Thesis]. Technische Universität Dortmund; 2007. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2003/24877.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Briest P. Computational aspects of combinatorial pricing problems. [Thesis]. Technische Universität Dortmund; 2007. Available from: http://hdl.handle.net/2003/24877

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Carnegie Mellon University

3. Wu, Yi. The Approximability of Learning and Constraint Satisfaction Problems.

Degree: 2010, Carnegie Mellon University

 An α-approximation algorithm is an algorithm guaranteed to output a solutionthat is within an α ratio of the optimal solution. We are interested in thefollowing… (more)

Subjects/Keywords: Complexity Theory; Approximation Algorithm; Computational Learning; Constraint Satisfaction Problem; Hardness of Approximation; Semidefinite Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, Y. (2010). The Approximability of Learning and Constraint Satisfaction Problems. (Thesis). Carnegie Mellon University. Retrieved from http://repository.cmu.edu/dissertations/24

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Thesis, Carnegie Mellon University. Accessed April 06, 2020. http://repository.cmu.edu/dissertations/24.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wu, Yi. “The Approximability of Learning and Constraint Satisfaction Problems.” 2010. Web. 06 Apr 2020.

Vancouver:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Internet] [Thesis]. Carnegie Mellon University; 2010. [cited 2020 Apr 06]. Available from: http://repository.cmu.edu/dissertations/24.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu Y. The Approximability of Learning and Constraint Satisfaction Problems. [Thesis]. Carnegie Mellon University; 2010. Available from: http://repository.cmu.edu/dissertations/24

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

4. Madan, Vivek. On approximability and LP formulations for multicut and feedback set problems.

Degree: PhD, Computer Science, 2018, University of Illinois – Urbana-Champaign

 Graph cut algorithms are an important tool for solving optimization problems in a variety of areas in computer science. Of particular importance is the min… (more)

Subjects/Keywords: Approximation; Multicut; Feedback set; Linear programming relaxation; Hardness of approximation; Linear cut; Multiway cut; Subset feedback set; Flow-cut gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Madan, V. (2018). On approximability and LP formulations for multicut and feedback set problems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/102390

Chicago Manual of Style (16th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/102390.

MLA Handbook (7th Edition):

Madan, Vivek. “On approximability and LP formulations for multicut and feedback set problems.” 2018. Web. 06 Apr 2020.

Vancouver:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2018. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/102390.

Council of Science Editors:

Madan V. On approximability and LP formulations for multicut and feedback set problems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/102390


University of Florida

5. Dinh, Thang N. Complex Networks under Attacks Vulnerability Assessment and Optimization.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2013, University of Florida

 Complex network systems are extremely vulnerable to attacks.  In the presence of uncertainty,  assessing network vulnerability before potential malicious attacks is vital for network planning… (more)

Subjects/Keywords: Algorithms; Approximation; Connectivity; Cost efficiency; Eigenvalues; Hardness; Minimization of cost; Optimal solutions; Seeding; Vertices; approximation-algorithm  – complex-network  – pairwise-connectivity  – vulnerability-assessment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dinh, T. N. (2013). Complex Networks under Attacks Vulnerability Assessment and Optimization. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0045412

Chicago Manual of Style (16th Edition):

Dinh, Thang N. “Complex Networks under Attacks Vulnerability Assessment and Optimization.” 2013. Doctoral Dissertation, University of Florida. Accessed April 06, 2020. http://ufdc.ufl.edu/UFE0045412.

MLA Handbook (7th Edition):

Dinh, Thang N. “Complex Networks under Attacks Vulnerability Assessment and Optimization.” 2013. Web. 06 Apr 2020.

Vancouver:

Dinh TN. Complex Networks under Attacks Vulnerability Assessment and Optimization. [Internet] [Doctoral dissertation]. University of Florida; 2013. [cited 2020 Apr 06]. Available from: http://ufdc.ufl.edu/UFE0045412.

Council of Science Editors:

Dinh TN. Complex Networks under Attacks Vulnerability Assessment and Optimization. [Doctoral Dissertation]. University of Florida; 2013. Available from: http://ufdc.ufl.edu/UFE0045412


Linköping University

6. Kuivinen, Fredrik. Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups.

Degree: Computer and Information Science, 2005, Linköping University

  In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to… (more)

Subjects/Keywords: systems of equations; finite groups; NP-hardness; approximation; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kuivinen, F. (2005). Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3240

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kuivinen, Fredrik. “Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups.” 2005. Thesis, Linköping University. Accessed April 06, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3240.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kuivinen, Fredrik. “Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups.” 2005. Web. 06 Apr 2020.

Vancouver:

Kuivinen F. Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups. [Internet] [Thesis]. Linköping University; 2005. [cited 2020 Apr 06]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3240.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kuivinen F. Tight Approximability Results for the Maximum Solution Equation Problem over Abelian Groups. [Thesis]. Linköping University; 2005. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3240

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Rossi, Alfred Vincent, III. Temporal Clustering of Finite Metric Spaces and Spectral k-Clustering.

Degree: PhD, Computer Science and Engineering, 2017, The Ohio State University

 This thesis addresses clustering problems in two distinct settings. In the first setting we explore the notion of what it means for a graph to… (more)

Subjects/Keywords: Computer Science; clustering; multi-objective optimization; dynamic metric spaces; approximation algorithms; hardness of approximation

…NP-hardness of (O(1), O(1), poly(n))-Approximation… …Number of Clusters . . . . . . . . . . NP-hardness of ((1 − ε) ln(n),2… …Temporal (k,r,δ)-Clustering Approximation. . . . 3.2.1 Exact Number of Clusters… …Approximation of Temporal k-Median/k-Means . . . . 3.3.1 Approximation of Temporal Median Clustering… …hardness of approxima- tion for several variants of Temporal Clustering. The results in this… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rossi, Alfred Vincent, I. (2017). Temporal Clustering of Finite Metric Spaces and Spectral k-Clustering. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1500033042082458

Chicago Manual of Style (16th Edition):

Rossi, Alfred Vincent, III. “Temporal Clustering of Finite Metric Spaces and Spectral k-Clustering.” 2017. Doctoral Dissertation, The Ohio State University. Accessed April 06, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1500033042082458.

MLA Handbook (7th Edition):

Rossi, Alfred Vincent, III. “Temporal Clustering of Finite Metric Spaces and Spectral k-Clustering.” 2017. Web. 06 Apr 2020.

Vancouver:

Rossi, Alfred Vincent I. Temporal Clustering of Finite Metric Spaces and Spectral k-Clustering. [Internet] [Doctoral dissertation]. The Ohio State University; 2017. [cited 2020 Apr 06]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1500033042082458.

Council of Science Editors:

Rossi, Alfred Vincent I. Temporal Clustering of Finite Metric Spaces and Spectral k-Clustering. [Doctoral Dissertation]. The Ohio State University; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1500033042082458


University of Waterloo

8. Aazami, Ashkan. Hardness results and approximation algorithms for some problems on graphs.

Degree: 2008, University of Waterloo

 This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node… (more)

Subjects/Keywords: Approximation algorithm; Hardness of approximation; Power Dominating Set; Packing Steiner Tree; PTAS; Planar graphs; Integrality ratio

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aazami, A. (2008). Hardness results and approximation algorithms for some problems on graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4147

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Aazami, Ashkan. “Hardness results and approximation algorithms for some problems on graphs.” 2008. Thesis, University of Waterloo. Accessed April 06, 2020. http://hdl.handle.net/10012/4147.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Aazami, Ashkan. “Hardness results and approximation algorithms for some problems on graphs.” 2008. Web. 06 Apr 2020.

Vancouver:

Aazami A. Hardness results and approximation algorithms for some problems on graphs. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/10012/4147.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Aazami A. Hardness results and approximation algorithms for some problems on graphs. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/4147

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Georgia Tech

9. Ponnuswami, Ashok Kumar. Intractability Results for some Computational Problems.

Degree: PhD, Computing, 2008, Georgia Tech

 In this thesis, we show results for some well-studied problems from learning theory and combinatorial optimization. Learning Parities under the Uniform Distribution: We study the… (more)

Subjects/Keywords: Hardness of approximation; Max-Clique; Agnostic learning; Parities; Halfspaces; Thresholds; Circuit lower bounds; Combinatorial optimization; Computational learning theory; Machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ponnuswami, A. K. (2008). Intractability Results for some Computational Problems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/24638

Chicago Manual of Style (16th Edition):

Ponnuswami, Ashok Kumar. “Intractability Results for some Computational Problems.” 2008. Doctoral Dissertation, Georgia Tech. Accessed April 06, 2020. http://hdl.handle.net/1853/24638.

MLA Handbook (7th Edition):

Ponnuswami, Ashok Kumar. “Intractability Results for some Computational Problems.” 2008. Web. 06 Apr 2020.

Vancouver:

Ponnuswami AK. Intractability Results for some Computational Problems. [Internet] [Doctoral dissertation]. Georgia Tech; 2008. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/1853/24638.

Council of Science Editors:

Ponnuswami AK. Intractability Results for some Computational Problems. [Doctoral Dissertation]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/24638


University of Toronto

10. Georgiou, Konstantinos. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations.

Degree: 2010, University of Toronto

The inapproximability for NP-hard combinatorial optimization problems lies in the heart of theoretical computer science. A negative result can be either conditional, where the starting… (more)

Subjects/Keywords: integrality gap; lift and project systems; convex optimization; combinatorial optimization; linear programming relaxations; semidefinite programming relaxations; minimum vertex cover; constraint satisfaction problem; Max Cut; Lovasz-Schrijver system; Sherali-Adams system; Lasserre system; hardness of approximation; 0984; 0405

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Georgiou, K. (2010). Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/26271

Chicago Manual of Style (16th Edition):

Georgiou, Konstantinos. “Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations.” 2010. Doctoral Dissertation, University of Toronto. Accessed April 06, 2020. http://hdl.handle.net/1807/26271.

MLA Handbook (7th Edition):

Georgiou, Konstantinos. “Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations.” 2010. Web. 06 Apr 2020.

Vancouver:

Georgiou K. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations. [Internet] [Doctoral dissertation]. University of Toronto; 2010. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/1807/26271.

Council of Science Editors:

Georgiou K. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations. [Doctoral Dissertation]. University of Toronto; 2010. Available from: http://hdl.handle.net/1807/26271

11. Agarwal, Naman. Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts.

Degree: MS, 0112, 2014, University of Illinois – Urbana-Champaign

 In this thesis we consider two questions motivated by the Unique Games Conjecture . The first question is concerned with the validity of the Unique… (more)

Subjects/Keywords: Unique Games Conjecture; Boolean Hypercube; MAX-LIN; Graph Lifts; Ramanujan graphs; Spectral Graph Theory; Hardness of Approximation; Integrality Gaps; Semi-definite Programming

of Hardness of Approximation, Social Choice etc. We refer the reader to an upcoming book by… …approximation algorithm achieves an approximation guarantee of 0.5 in expectation. In a famous paper… …that for MAX-CUT and for a lot of other problems the best possible approximation ratio is… …bounded away from 1. The PCP Theorem initiated a large body of work in the area of Hardness of… …Approximation. One of the first and the most significant work in this area was by Hastad [H˚as01… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Agarwal, N. (2014). Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/49366

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Agarwal, Naman. “Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed April 06, 2020. http://hdl.handle.net/2142/49366.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Agarwal, Naman. “Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts.” 2014. Web. 06 Apr 2020.

Vancouver:

Agarwal N. Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/2142/49366.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Agarwal N. Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/49366

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Chen, Cheng. Trustworthiness, diversity and inference in recommendation systems.

Degree: Department of Computer Science, 2016, University of Victoria

 Recommendation systems are information filtering systems that help users effectively and efficiently explore large amount of information and identify items of interest. Accurate predictions of… (more)

Subjects/Keywords: Bipartite Graphs; Matchings; NP-hardness; Linear Programming; Submodular Systems; Recommendation Systems; Anomaly Detection; Community Question and Answer Websites; Paid Posters; Adaptive Detection Systems; Weighted Bipartite b-Matching; Conflict Constraints; Optimization; Approximation; Reverse Engineering of Recommendations; Wi-Fi Data Mining; Profile Inference; Copula Modelling

…7.2 Generalizations of WBM for Explicit Diversity Requirements . . . . . 7.3 A General… …125 125 125 128 129 131 132 134 ix List of Tables Table Table Table Table Table 2.1 2.2… …Different Combinations of “SG” Features LIBSVM Kernel Types… …24 26 37 37 40 Table Table Table Table 3.1 3.2 3.3 3.4 Basic Information of Synthetic… …and Real-world Datasets . . . Problem Size of LP Formulation for Each Subset of eBay US… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, C. (2016). Trustworthiness, diversity and inference in recommendation systems. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7576

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Cheng. “Trustworthiness, diversity and inference in recommendation systems.” 2016. Thesis, University of Victoria. Accessed April 06, 2020. http://hdl.handle.net/1828/7576.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Cheng. “Trustworthiness, diversity and inference in recommendation systems.” 2016. Web. 06 Apr 2020.

Vancouver:

Chen C. Trustworthiness, diversity and inference in recommendation systems. [Internet] [Thesis]. University of Victoria; 2016. [cited 2020 Apr 06]. Available from: http://hdl.handle.net/1828/7576.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen C. Trustworthiness, diversity and inference in recommendation systems. [Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7576

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.