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:(Graph clustering). Showing records 1 – 30 of 127 total matches.

[1] [2] [3] [4] [5]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


Princeton University

1. Sandon, Colin Peter. Community Detection in the Stochastic Block Model: fundamental limits .

Degree: PhD, 2017, Princeton University

 In recent years, there have been many developments in the study of the stochastic block model, starting with a paper by Decelle et al. in… (more)

Subjects/Keywords: clustering; graph

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sandon, C. P. (2017). Community Detection in the Stochastic Block Model: fundamental limits . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp011v53k058n

Chicago Manual of Style (16th Edition):

Sandon, Colin Peter. “Community Detection in the Stochastic Block Model: fundamental limits .” 2017. Doctoral Dissertation, Princeton University. Accessed May 25, 2019. http://arks.princeton.edu/ark:/88435/dsp011v53k058n.

MLA Handbook (7th Edition):

Sandon, Colin Peter. “Community Detection in the Stochastic Block Model: fundamental limits .” 2017. Web. 25 May 2019.

Vancouver:

Sandon CP. Community Detection in the Stochastic Block Model: fundamental limits . [Internet] [Doctoral dissertation]. Princeton University; 2017. [cited 2019 May 25]. Available from: http://arks.princeton.edu/ark:/88435/dsp011v53k058n.

Council of Science Editors:

Sandon CP. Community Detection in the Stochastic Block Model: fundamental limits . [Doctoral Dissertation]. Princeton University; 2017. Available from: http://arks.princeton.edu/ark:/88435/dsp011v53k058n

2. Zanghi, Hugo. Approches modèles pour la structuration du web vu comme un graphe : Model based approaches for uncovering web structures.

Degree: Docteur es, Mathématiques appliquées, 2010, Evry-Val d'Essonne

L’analyse statistique des réseaux complexes est une tâche difficile, étant donné que des modèles statistiques appropriés et des procédures de calcul efficaces sont nécessaires afin… (more)

Subjects/Keywords: Partitionnement de graphe; Graph clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zanghi, H. (2010). Approches modèles pour la structuration du web vu comme un graphe : Model based approaches for uncovering web structures. (Doctoral Dissertation). Evry-Val d'Essonne. Retrieved from http://www.theses.fr/2010EVRY0041

Chicago Manual of Style (16th Edition):

Zanghi, Hugo. “Approches modèles pour la structuration du web vu comme un graphe : Model based approaches for uncovering web structures.” 2010. Doctoral Dissertation, Evry-Val d'Essonne. Accessed May 25, 2019. http://www.theses.fr/2010EVRY0041.

MLA Handbook (7th Edition):

Zanghi, Hugo. “Approches modèles pour la structuration du web vu comme un graphe : Model based approaches for uncovering web structures.” 2010. Web. 25 May 2019.

Vancouver:

Zanghi H. Approches modèles pour la structuration du web vu comme un graphe : Model based approaches for uncovering web structures. [Internet] [Doctoral dissertation]. Evry-Val d'Essonne; 2010. [cited 2019 May 25]. Available from: http://www.theses.fr/2010EVRY0041.

Council of Science Editors:

Zanghi H. Approches modèles pour la structuration du web vu comme un graphe : Model based approaches for uncovering web structures. [Doctoral Dissertation]. Evry-Val d'Essonne; 2010. Available from: http://www.theses.fr/2010EVRY0041


Mississippi State University

3. Zhang, Fangyan. Large-scale graph visual analytics.

Degree: PhD, Computer Science and Engineering, 2017, Mississippi State University

  Large-scale graph analysis and visualization is becoming a more challenging task, due to the increasing amount of graph data. This dissertation focuses on methods… (more)

Subjects/Keywords: large-scale graph; graph sampling; graph property; graph visualization; graph clustering; graph hierarchy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, F. (2017). Large-scale graph visual analytics. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;

Chicago Manual of Style (16th Edition):

Zhang, Fangyan. “Large-scale graph visual analytics.” 2017. Doctoral Dissertation, Mississippi State University. Accessed May 25, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;.

MLA Handbook (7th Edition):

Zhang, Fangyan. “Large-scale graph visual analytics.” 2017. Web. 25 May 2019.

Vancouver:

Zhang F. Large-scale graph visual analytics. [Internet] [Doctoral dissertation]. Mississippi State University; 2017. [cited 2019 May 25]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;.

Council of Science Editors:

Zhang F. Large-scale graph visual analytics. [Doctoral Dissertation]. Mississippi State University; 2017. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10232017-142140/ ;


IUPUI

4. Mandal, Aritra. Distributed graph decomposition algorithms on Apache Spark.

Degree: 2018, IUPUI

Indiana University-Purdue University Indianapolis (IUPUI)

Structural analysis and mining of large and complex graphs for describing the characteristics of a vertex or an edge in… (more)

Subjects/Keywords: Graph Mining; Big Data; Apache Spark; Graph Decomposition; Graph Partitioning; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mandal, A. (2018). Distributed graph decomposition algorithms on Apache Spark. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/16924

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):

Mandal, Aritra. “Distributed graph decomposition algorithms on Apache Spark.” 2018. Thesis, IUPUI. Accessed May 25, 2019. http://hdl.handle.net/1805/16924.

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

MLA Handbook (7th Edition):

Mandal, Aritra. “Distributed graph decomposition algorithms on Apache Spark.” 2018. Web. 25 May 2019.

Vancouver:

Mandal A. Distributed graph decomposition algorithms on Apache Spark. [Internet] [Thesis]. IUPUI; 2018. [cited 2019 May 25]. Available from: http://hdl.handle.net/1805/16924.

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

Council of Science Editors:

Mandal A. Distributed graph decomposition algorithms on Apache Spark. [Thesis]. IUPUI; 2018. Available from: http://hdl.handle.net/1805/16924

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


Université Catholique de Louvain

5. Van Lierde, Hadrien. Spectral clustering algorithms for directed graphs.

Degree: 2015, Université Catholique de Louvain

In this report, we present three spectral algorithms for partitioning nodes in directed graphs respectively with a cyclic and an acyclic pattern of connection between… (more)

Subjects/Keywords: Complex networks; directed graph clustering; spectral clustering; spectral graph theory; cyclic graph; acyclic graph; trophic network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Lierde, H. (2015). Spectral clustering algorithms for directed graphs. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:8207

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):

Van Lierde, Hadrien. “Spectral clustering algorithms for directed graphs.” 2015. Thesis, Université Catholique de Louvain. Accessed May 25, 2019. http://hdl.handle.net/2078.1/thesis:8207.

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

MLA Handbook (7th Edition):

Van Lierde, Hadrien. “Spectral clustering algorithms for directed graphs.” 2015. Web. 25 May 2019.

Vancouver:

Van Lierde H. Spectral clustering algorithms for directed graphs. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2019 May 25]. Available from: http://hdl.handle.net/2078.1/thesis:8207.

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

Council of Science Editors:

Van Lierde H. Spectral clustering algorithms for directed graphs. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/thesis:8207

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


University of Windsor

6. Chertov, Anton. Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs.

Degree: MS, Computer Science, 2012, University of Windsor

 In this thesis we evaluate current neighbour-based graph clustering algorithms: SCAN, DHSCAN, and AHSCAN. These algorithms possess the ability to identify special nodes in graphs… (more)

Subjects/Keywords: AHSCAN; DHSCAN; edge weights; graph clustering; SCAN

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chertov, A. (2012). Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5408

Chicago Manual of Style (16th Edition):

Chertov, Anton. “Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs.” 2012. Masters Thesis, University of Windsor. Accessed May 25, 2019. https://scholar.uwindsor.ca/etd/5408.

MLA Handbook (7th Edition):

Chertov, Anton. “Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs.” 2012. Web. 25 May 2019.

Vancouver:

Chertov A. Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs. [Internet] [Masters thesis]. University of Windsor; 2012. [cited 2019 May 25]. Available from: https://scholar.uwindsor.ca/etd/5408.

Council of Science Editors:

Chertov A. Extension of graph clustering algorithms based on SCAN method in order to target weighted graphs. [Masters Thesis]. University of Windsor; 2012. Available from: https://scholar.uwindsor.ca/etd/5408


University of Connecticut

7. Adelson, Jonathan. A Method for Network Clustering and Cluster Based Routing.

Degree: MS, Computer Science and Engineering, 2013, University of Connecticut

  Social networks and sensor networks are two very different types of networks that have been made possible by modern technology. Portable wireless devices, including… (more)

Subjects/Keywords: clustering routing graph network groups overlapping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adelson, J. (2013). A Method for Network Clustering and Cluster Based Routing. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/434

Chicago Manual of Style (16th Edition):

Adelson, Jonathan. “A Method for Network Clustering and Cluster Based Routing.” 2013. Masters Thesis, University of Connecticut. Accessed May 25, 2019. https://opencommons.uconn.edu/gs_theses/434.

MLA Handbook (7th Edition):

Adelson, Jonathan. “A Method for Network Clustering and Cluster Based Routing.” 2013. Web. 25 May 2019.

Vancouver:

Adelson J. A Method for Network Clustering and Cluster Based Routing. [Internet] [Masters thesis]. University of Connecticut; 2013. [cited 2019 May 25]. Available from: https://opencommons.uconn.edu/gs_theses/434.

Council of Science Editors:

Adelson J. A Method for Network Clustering and Cluster Based Routing. [Masters Thesis]. University of Connecticut; 2013. Available from: https://opencommons.uconn.edu/gs_theses/434


North Carolina State University

8. Liu, Ning. Spectral Clustering for Graphs and Markov Chains.

Degree: PhD, Computer Science, 2010, North Carolina State University

 Spectral graph partitioning based on spectral theory has become a popular clustering method over the last few years. The starting point is the work of… (more)

Subjects/Keywords: spectral clustering; graph partitioning; markov chains; eigenvalue

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, N. (2010). Spectral Clustering for Graphs and Markov Chains. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4886

Chicago Manual of Style (16th Edition):

Liu, Ning. “Spectral Clustering for Graphs and Markov Chains.” 2010. Doctoral Dissertation, North Carolina State University. Accessed May 25, 2019. http://www.lib.ncsu.edu/resolver/1840.16/4886.

MLA Handbook (7th Edition):

Liu, Ning. “Spectral Clustering for Graphs and Markov Chains.” 2010. Web. 25 May 2019.

Vancouver:

Liu N. Spectral Clustering for Graphs and Markov Chains. [Internet] [Doctoral dissertation]. North Carolina State University; 2010. [cited 2019 May 25]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4886.

Council of Science Editors:

Liu N. Spectral Clustering for Graphs and Markov Chains. [Doctoral Dissertation]. North Carolina State University; 2010. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4886


Université Catholique de Louvain

9. Collette, Augustin. Comparison of some community detection methods for social network analysis.

Degree: 2015, Université Catholique de Louvain

Social networks have been a major innovation in the business field for the last decade. This work focuses on the analysis of networks (a great… (more)

Subjects/Keywords: graph mining; social networks; kernel clustering; hierarchical clustering.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Collette, A. (2015). Comparison of some community detection methods for social network analysis. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:3104

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):

Collette, Augustin. “Comparison of some community detection methods for social network analysis.” 2015. Thesis, Université Catholique de Louvain. Accessed May 25, 2019. http://hdl.handle.net/2078.1/thesis:3104.

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

MLA Handbook (7th Edition):

Collette, Augustin. “Comparison of some community detection methods for social network analysis.” 2015. Web. 25 May 2019.

Vancouver:

Collette A. Comparison of some community detection methods for social network analysis. [Internet] [Thesis]. Université Catholique de Louvain; 2015. [cited 2019 May 25]. Available from: http://hdl.handle.net/2078.1/thesis:3104.

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

Council of Science Editors:

Collette A. Comparison of some community detection methods for social network analysis. [Thesis]. Université Catholique de Louvain; 2015. Available from: http://hdl.handle.net/2078.1/thesis:3104

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


University of Manitoba

10. Liu, Ying Ying. A Polymorphic Ant-Based Algorithm for Graph Clustering.

Degree: Computer Science, 2016, University of Manitoba

 In this thesis, I introduce two new algorithms: Ant Brood Clustering-Intelligent Ants (ABC-INTE) and Ant Brood Clustering-Polymorphic Ants (ABC-POLY) for the graph clustering problem. ABC-INTE… (more)

Subjects/Keywords: Swarm Intelligence; Metaheuristics; Graph Clustering; Ant Colony Optimization; Ant Brood Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Y. Y. (2016). A Polymorphic Ant-Based Algorithm for Graph Clustering. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31202

Chicago Manual of Style (16th Edition):

Liu, Ying Ying. “A Polymorphic Ant-Based Algorithm for Graph Clustering.” 2016. Masters Thesis, University of Manitoba. Accessed May 25, 2019. http://hdl.handle.net/1993/31202.

MLA Handbook (7th Edition):

Liu, Ying Ying. “A Polymorphic Ant-Based Algorithm for Graph Clustering.” 2016. Web. 25 May 2019.

Vancouver:

Liu YY. A Polymorphic Ant-Based Algorithm for Graph Clustering. [Internet] [Masters thesis]. University of Manitoba; 2016. [cited 2019 May 25]. Available from: http://hdl.handle.net/1993/31202.

Council of Science Editors:

Liu YY. A Polymorphic Ant-Based Algorithm for Graph Clustering. [Masters Thesis]. University of Manitoba; 2016. Available from: http://hdl.handle.net/1993/31202


Georgia Tech

11. Fairbanks, James Paul. Graph analysis combining numerical, statistical, and streaming techniques.

Degree: PhD, Computational Science and Engineering, 2016, Georgia Tech

Graph analysis uses graph data collected on a physical, biological, or social phenomena to shed light on the underlying dynamics and behavior of the agents… (more)

Subjects/Keywords: Graph analysis; Graph algorithms; Data analysis; Spectral clustering; Numerical analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fairbanks, J. P. (2016). Graph analysis combining numerical, statistical, and streaming techniques. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54972

Chicago Manual of Style (16th Edition):

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Doctoral Dissertation, Georgia Tech. Accessed May 25, 2019. http://hdl.handle.net/1853/54972.

MLA Handbook (7th Edition):

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Web. 25 May 2019.

Vancouver:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 May 25]. Available from: http://hdl.handle.net/1853/54972.

Council of Science Editors:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/54972


Virginia Tech

12. Maxwell, Evan Kyle. Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering.

Degree: MS, Computer Science, 2010, Virginia Tech

 Large graph-based datasets are common to many applications because of the additional structure provided to data by graphs. Patterns extracted from graphs must adhere to… (more)

Subjects/Keywords: graph mining; graph clustering; multipartite cliques; memory leak detection; bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maxwell, E. K. (2010). Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34008

Chicago Manual of Style (16th Edition):

Maxwell, Evan Kyle. “Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering.” 2010. Masters Thesis, Virginia Tech. Accessed May 25, 2019. http://hdl.handle.net/10919/34008.

MLA Handbook (7th Edition):

Maxwell, Evan Kyle. “Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering.” 2010. Web. 25 May 2019.

Vancouver:

Maxwell EK. Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering. [Internet] [Masters thesis]. Virginia Tech; 2010. [cited 2019 May 25]. Available from: http://hdl.handle.net/10919/34008.

Council of Science Editors:

Maxwell EK. Graph Mining Algorithms for Memory Leak Diagnosis and Biological Database Clustering. [Masters Thesis]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/34008


University of Minnesota

13. LaSalle, Dominique. Graph Partitioning, Ordering, and Clustering for Multicore Architectures.

Degree: PhD, Computer Science, 2015, University of Minnesota

 The terms dual-core and quad-core have become ubiquitous for modern computer processors. Where processors previously had a single powerful processing core, they now have multiple… (more)

Subjects/Keywords: Fill Reducing Ordering; Graph Clustering; Graph Partitioning; Multicore

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LaSalle, D. (2015). Graph Partitioning, Ordering, and Clustering for Multicore Architectures. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/177147

Chicago Manual of Style (16th Edition):

LaSalle, Dominique. “Graph Partitioning, Ordering, and Clustering for Multicore Architectures.” 2015. Doctoral Dissertation, University of Minnesota. Accessed May 25, 2019. http://hdl.handle.net/11299/177147.

MLA Handbook (7th Edition):

LaSalle, Dominique. “Graph Partitioning, Ordering, and Clustering for Multicore Architectures.” 2015. Web. 25 May 2019.

Vancouver:

LaSalle D. Graph Partitioning, Ordering, and Clustering for Multicore Architectures. [Internet] [Doctoral dissertation]. University of Minnesota; 2015. [cited 2019 May 25]. Available from: http://hdl.handle.net/11299/177147.

Council of Science Editors:

LaSalle D. Graph Partitioning, Ordering, and Clustering for Multicore Architectures. [Doctoral Dissertation]. University of Minnesota; 2015. Available from: http://hdl.handle.net/11299/177147


University of Cincinnati

14. Wang, Nan. A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm.

Degree: PhD, Engineering and Applied Science: Computer Science and Engineering, 2017, University of Cincinnati

Graph vertex and edge deletion algorithms are normally studied separately. We develop aframework to link them by transferring any existing vertex deletion algorithms to a… (more)

Subjects/Keywords: Computer Science; Graph; Vetex Deletion; Edge Deletion; Neighborhood; Graph Clustering; Graph Sparsification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, N. (2017). A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1504878748832156

Chicago Manual of Style (16th Edition):

Wang, Nan. “A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm.” 2017. Doctoral Dissertation, University of Cincinnati. Accessed May 25, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1504878748832156.

MLA Handbook (7th Edition):

Wang, Nan. “A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm.” 2017. Web. 25 May 2019.

Vancouver:

Wang N. A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm. [Internet] [Doctoral dissertation]. University of Cincinnati; 2017. [cited 2019 May 25]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1504878748832156.

Council of Science Editors:

Wang N. A Framework of Transforming Vertex Deletion Algorithm to Edge Deletion Algorithm. [Doctoral Dissertation]. University of Cincinnati; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1504878748832156


KTH

15. Charpentier, Bertrand. Multi-scale clustering in graphs using modularity.

Degree: Electrical Engineering and Computer Science (EECS), 2019, KTH

This thesis provides a new hierarchical clustering algorithm for graphs, named Paris, which can be interpreted through the modularity score and its resolution parameter.… (more)

Subjects/Keywords: Hierarchical clustering; Multi-scale clustering; Graph; Modularity; Resolution; Dendrogram; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Charpentier, B. (2019). Multi-scale clustering in graphs using modularity. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847

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):

Charpentier, Bertrand. “Multi-scale clustering in graphs using modularity.” 2019. Thesis, KTH. Accessed May 25, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847.

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

MLA Handbook (7th Edition):

Charpentier, Bertrand. “Multi-scale clustering in graphs using modularity.” 2019. Web. 25 May 2019.

Vancouver:

Charpentier B. Multi-scale clustering in graphs using modularity. [Internet] [Thesis]. KTH; 2019. [cited 2019 May 25]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847.

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

Council of Science Editors:

Charpentier B. Multi-scale clustering in graphs using modularity. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847

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


Georgia Tech

16. Du, Rundong. Nonnegative matrix factorization for text, graph, and hybrid data analytics.

Degree: PhD, Mathematics, 2018, Georgia Tech

 Constrained low rank approximation is a general framework for data analysis, which usually has the advantage of being simple, fast, scalable and domain general. One… (more)

Subjects/Keywords: Constrained low rank approximation; Nonnegative matrix factorization; Data analytics; Content clustering; Graph clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Du, R. (2018). Nonnegative matrix factorization for text, graph, and hybrid data analytics. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59914

Chicago Manual of Style (16th Edition):

Du, Rundong. “Nonnegative matrix factorization for text, graph, and hybrid data analytics.” 2018. Doctoral Dissertation, Georgia Tech. Accessed May 25, 2019. http://hdl.handle.net/1853/59914.

MLA Handbook (7th Edition):

Du, Rundong. “Nonnegative matrix factorization for text, graph, and hybrid data analytics.” 2018. Web. 25 May 2019.

Vancouver:

Du R. Nonnegative matrix factorization for text, graph, and hybrid data analytics. [Internet] [Doctoral dissertation]. Georgia Tech; 2018. [cited 2019 May 25]. Available from: http://hdl.handle.net/1853/59914.

Council of Science Editors:

Du R. Nonnegative matrix factorization for text, graph, and hybrid data analytics. [Doctoral Dissertation]. Georgia Tech; 2018. Available from: http://hdl.handle.net/1853/59914


East Tennessee State University

17. Witt, Walter G. Quantifying the Structure of Misfolded Proteins Using Graph Theory.

Degree: MS, Mathematical Sciences, 2017, East Tennessee State University

  The structure of a protein molecule is highly correlated to its function. Some diseases such as cystic fibrosis are the result of a change… (more)

Subjects/Keywords: mathematical biology; graph theory; proteins; spectral clustering; computational biology; nest graph model; Other Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Witt, W. G. (2017). Quantifying the Structure of Misfolded Proteins Using Graph Theory. (Masters Thesis). East Tennessee State University. Retrieved from https://dc.etsu.edu/etd/3244

Chicago Manual of Style (16th Edition):

Witt, Walter G. “Quantifying the Structure of Misfolded Proteins Using Graph Theory.” 2017. Masters Thesis, East Tennessee State University. Accessed May 25, 2019. https://dc.etsu.edu/etd/3244.

MLA Handbook (7th Edition):

Witt, Walter G. “Quantifying the Structure of Misfolded Proteins Using Graph Theory.” 2017. Web. 25 May 2019.

Vancouver:

Witt WG. Quantifying the Structure of Misfolded Proteins Using Graph Theory. [Internet] [Masters thesis]. East Tennessee State University; 2017. [cited 2019 May 25]. Available from: https://dc.etsu.edu/etd/3244.

Council of Science Editors:

Witt WG. Quantifying the Structure of Misfolded Proteins Using Graph Theory. [Masters Thesis]. East Tennessee State University; 2017. Available from: https://dc.etsu.edu/etd/3244


Washington State University

18. [No author]. Parallel Algorithms for Large-scale Computational Metagenomics .

Degree: 2011, Washington State University

 Developing high performance computing solutions for modern day biological problems present a unique set of challenges. The field is experiencing a data revolution due to… (more)

Subjects/Keywords: Computer Science; Bioinformatics; Bioinformatics; Computational Biology; Graph Algorithms; Graph Construction; High Performance Computing; Sequence Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2011). Parallel Algorithms for Large-scale Computational Metagenomics . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/2889

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):

author], [No. “Parallel Algorithms for Large-scale Computational Metagenomics .” 2011. Thesis, Washington State University. Accessed May 25, 2019. http://hdl.handle.net/2376/2889.

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

MLA Handbook (7th Edition):

author], [No. “Parallel Algorithms for Large-scale Computational Metagenomics .” 2011. Web. 25 May 2019.

Vancouver:

author] [. Parallel Algorithms for Large-scale Computational Metagenomics . [Internet] [Thesis]. Washington State University; 2011. [cited 2019 May 25]. Available from: http://hdl.handle.net/2376/2889.

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

Council of Science Editors:

author] [. Parallel Algorithms for Large-scale Computational Metagenomics . [Thesis]. Washington State University; 2011. Available from: http://hdl.handle.net/2376/2889

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

19. Nascimento, Mariá Cristina Vasconcelos. Metaheurísticas para o problema de agrupamento de dados em grafo.

Degree: PhD, Ciências de Computação e Matemática Computacional, 2010, University of São Paulo

O problema de agrupamento de dados em grafos consiste em encontrar clusters de nós em um dado grafo, ou seja, encontrar subgrafos com alta conectividade.… (more)

Subjects/Keywords: Agrupamento de dados em grafos; Clustering coefficient; Clustering Coefficient; Community detection; Detecção de comunidades; Graph clustering; GRASP; GRASP; Modularidade; Modularity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nascimento, M. C. V. (2010). Metaheurísticas para o problema de agrupamento de dados em grafo. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17052010-155334/ ;

Chicago Manual of Style (16th Edition):

Nascimento, Mariá Cristina Vasconcelos. “Metaheurísticas para o problema de agrupamento de dados em grafo.” 2010. Doctoral Dissertation, University of São Paulo. Accessed May 25, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17052010-155334/ ;.

MLA Handbook (7th Edition):

Nascimento, Mariá Cristina Vasconcelos. “Metaheurísticas para o problema de agrupamento de dados em grafo.” 2010. Web. 25 May 2019.

Vancouver:

Nascimento MCV. Metaheurísticas para o problema de agrupamento de dados em grafo. [Internet] [Doctoral dissertation]. University of São Paulo; 2010. [cited 2019 May 25]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17052010-155334/ ;.

Council of Science Editors:

Nascimento MCV. Metaheurísticas para o problema de agrupamento de dados em grafo. [Doctoral Dissertation]. University of São Paulo; 2010. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-17052010-155334/ ;


University of Cincinnati

20. Sardana, Divya. Analysis of Meso-scale Structures in Weighted Graphs.

Degree: PhD, Engineering and Applied Science: Computer Science and Engineering, 2017, University of Cincinnati

 Many real world systems across multiple disciplines, like social, biologicaland information networks can be described as complex networks,i.e., assemblies of nodes and edges having nontrivial… (more)

Subjects/Keywords: Computer Science; community structure; core periphery structure; graph clustering; protein protein interaction networks; semi supervised clustering; overlapping clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sardana, D. (2017). Analysis of Meso-scale Structures in Weighted Graphs. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038

Chicago Manual of Style (16th Edition):

Sardana, Divya. “Analysis of Meso-scale Structures in Weighted Graphs.” 2017. Doctoral Dissertation, University of Cincinnati. Accessed May 25, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038.

MLA Handbook (7th Edition):

Sardana, Divya. “Analysis of Meso-scale Structures in Weighted Graphs.” 2017. Web. 25 May 2019.

Vancouver:

Sardana D. Analysis of Meso-scale Structures in Weighted Graphs. [Internet] [Doctoral dissertation]. University of Cincinnati; 2017. [cited 2019 May 25]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038.

Council of Science Editors:

Sardana D. Analysis of Meso-scale Structures in Weighted Graphs. [Doctoral Dissertation]. University of Cincinnati; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1510927111275038


University of Alberta

21. Graves, Daniel. Development of Partially Supervised Kernel-based Proximity Clustering Frameworks and Their Applications.

Degree: PhD, Department of Electrical and Computer Engineering, 2011, University of Alberta

 The focus of this study is the development and evaluation of a new partially supervised learning framework. This framework belongs to an emerging field in… (more)

Subjects/Keywords: Kernel-based clustering; Structural musical segmentation; Time series analysis; Multi-proximity clustering; Partially supervised learning; Active learning; Graph clustering; Fuzzy clustering; Time series clustering; Proximity hints

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Graves, D. (2011). Development of Partially Supervised Kernel-based Proximity Clustering Frameworks and Their Applications. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cr56n183g

Chicago Manual of Style (16th Edition):

Graves, Daniel. “Development of Partially Supervised Kernel-based Proximity Clustering Frameworks and Their Applications.” 2011. Doctoral Dissertation, University of Alberta. Accessed May 25, 2019. https://era.library.ualberta.ca/files/cr56n183g.

MLA Handbook (7th Edition):

Graves, Daniel. “Development of Partially Supervised Kernel-based Proximity Clustering Frameworks and Their Applications.” 2011. Web. 25 May 2019.

Vancouver:

Graves D. Development of Partially Supervised Kernel-based Proximity Clustering Frameworks and Their Applications. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2019 May 25]. Available from: https://era.library.ualberta.ca/files/cr56n183g.

Council of Science Editors:

Graves D. Development of Partially Supervised Kernel-based Proximity Clustering Frameworks and Their Applications. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/cr56n183g


University of Washington

22. Wan, Yali. Topics in Graph Clustering.

Degree: PhD, 2017, University of Washington

 In this thesis, two problems in social networks will be studied. In the first part of the thesis, we focus on community recovery problems for… (more)

Subjects/Keywords: community recovery; graph clustering; graph perturbation; model-based; model-free; robustness of graph properties; Statistics; Mathematics; Computer science; Statistics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wan, Y. (2017). Topics in Graph Clustering. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/40717

Chicago Manual of Style (16th Edition):

Wan, Yali. “Topics in Graph Clustering.” 2017. Doctoral Dissertation, University of Washington. Accessed May 25, 2019. http://hdl.handle.net/1773/40717.

MLA Handbook (7th Edition):

Wan, Yali. “Topics in Graph Clustering.” 2017. Web. 25 May 2019.

Vancouver:

Wan Y. Topics in Graph Clustering. [Internet] [Doctoral dissertation]. University of Washington; 2017. [cited 2019 May 25]. Available from: http://hdl.handle.net/1773/40717.

Council of Science Editors:

Wan Y. Topics in Graph Clustering. [Doctoral Dissertation]. University of Washington; 2017. Available from: http://hdl.handle.net/1773/40717


Virginia Commonwealth University

23. Donachy, Shaun. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.

Degree: MS, Computer Science, 2015, Virginia Commonwealth University

  Networks of spiking neurons can be used not only for brain modeling but also to solve graph problems. With the use of a computationally… (more)

Subjects/Keywords: Spiking Neural Networks; Plasticity; Shortest Path; Graph Clustering; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Donachy, S. (2015). Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. (Thesis). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/3984

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):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Thesis, Virginia Commonwealth University. Accessed May 25, 2019. https://scholarscompass.vcu.edu/etd/3984.

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

MLA Handbook (7th Edition):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Web. 25 May 2019.

Vancouver:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Internet] [Thesis]. Virginia Commonwealth University; 2015. [cited 2019 May 25]. Available from: https://scholarscompass.vcu.edu/etd/3984.

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

Council of Science Editors:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Thesis]. Virginia Commonwealth University; 2015. Available from: https://scholarscompass.vcu.edu/etd/3984

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


University of Utah

24. Yadav, Nitin. Community-affinity: measuring strength of memberships of nodes in network communities.

Degree: MSin Computing, School of Computing, 2015, University of Utah

 Detecting community structure in networks has been a widely studied area. While mostof the methods produce an exclusive membership of the nodes, the nodes in… (more)

Subjects/Keywords: community-affinity; community-detection; graph clustering; graphs; network science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yadav, N. (2015). Community-affinity: measuring strength of memberships of nodes in network communities. (Masters Thesis). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4069/rec/497

Chicago Manual of Style (16th Edition):

Yadav, Nitin. “Community-affinity: measuring strength of memberships of nodes in network communities.” 2015. Masters Thesis, University of Utah. Accessed May 25, 2019. http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4069/rec/497.

MLA Handbook (7th Edition):

Yadav, Nitin. “Community-affinity: measuring strength of memberships of nodes in network communities.” 2015. Web. 25 May 2019.

Vancouver:

Yadav N. Community-affinity: measuring strength of memberships of nodes in network communities. [Internet] [Masters thesis]. University of Utah; 2015. [cited 2019 May 25]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4069/rec/497.

Council of Science Editors:

Yadav N. Community-affinity: measuring strength of memberships of nodes in network communities. [Masters Thesis]. University of Utah; 2015. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/4069/rec/497


NSYSU

25. Liao, Chih-lun. Efficiency Improvement for Collaborative Filtering Recommender System.

Degree: Master, Electrical Engineering, 2015, NSYSU

 In collaborative ï¬ltering based recommender systems, products are regarded as features and users are required to provide rating scores to the products they have purchased.… (more)

Subjects/Keywords: ranking algorithm; clustering; feature extraction; correlation graph; Recommender system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, C. (2015). Efficiency Improvement for Collaborative Filtering Recommender System. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151

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):

Liao, Chih-lun. “Efficiency Improvement for Collaborative Filtering Recommender System.” 2015. Thesis, NSYSU. Accessed May 25, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151.

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

MLA Handbook (7th Edition):

Liao, Chih-lun. “Efficiency Improvement for Collaborative Filtering Recommender System.” 2015. Web. 25 May 2019.

Vancouver:

Liao C. Efficiency Improvement for Collaborative Filtering Recommender System. [Internet] [Thesis]. NSYSU; 2015. [cited 2019 May 25]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151.

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

Council of Science Editors:

Liao C. Efficiency Improvement for Collaborative Filtering Recommender System. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0731115-161151

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


University of Tennessee – Knoxville

26. Phillips, Charles Alexander. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.

Degree: 2015, University of Tennessee – Knoxville

 The explosive growth in the rate of data generation in recent years threatens to outpace the growth in computer power, motivating the need for new,… (more)

Subjects/Keywords: graph algorithms; combinatorics; clustering; multipartite; biclique; Computational Biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phillips, C. A. (2015). Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/3600

Chicago Manual of Style (16th Edition):

Phillips, Charles Alexander. “Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.” 2015. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed May 25, 2019. https://trace.tennessee.edu/utk_graddiss/3600.

MLA Handbook (7th Edition):

Phillips, Charles Alexander. “Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.” 2015. Web. 25 May 2019.

Vancouver:

Phillips CA. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2015. [cited 2019 May 25]. Available from: https://trace.tennessee.edu/utk_graddiss/3600.

Council of Science Editors:

Phillips CA. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2015. Available from: https://trace.tennessee.edu/utk_graddiss/3600


Mississippi State University

27. Akula, Ravi Kiran. Botnet detection using graph based feature clustering.

Degree: MS, Industrial and Systems Engineering, 2018, Mississippi State University

  Detecting botnets in a network is crucial because bot-activities impact numerous areas such as security, finance, health care, and law enforcement. Most existing rule… (more)

Subjects/Keywords: Cyber sequrity; graph based features; bot detection; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akula, R. K. (2018). Botnet detection using graph based feature clustering. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202017-112646/ ;

Chicago Manual of Style (16th Edition):

Akula, Ravi Kiran. “Botnet detection using graph based feature clustering.” 2018. Masters Thesis, Mississippi State University. Accessed May 25, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202017-112646/ ;.

MLA Handbook (7th Edition):

Akula, Ravi Kiran. “Botnet detection using graph based feature clustering.” 2018. Web. 25 May 2019.

Vancouver:

Akula RK. Botnet detection using graph based feature clustering. [Internet] [Masters thesis]. Mississippi State University; 2018. [cited 2019 May 25]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202017-112646/ ;.

Council of Science Editors:

Akula RK. Botnet detection using graph based feature clustering. [Masters Thesis]. Mississippi State University; 2018. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-10202017-112646/ ;


Linnaeus University

28. Aleksakhin, Vladyslav. Visualization of gene ontology and cluster analysis results.

Degree: Physics and Mathematics, 2012, Linnaeus University

  The purpose of the thesis is to develop a new visualization method for Gene Ontologiesand hierarchical clustering. These are both important tools in biology… (more)

Subjects/Keywords: Graph Visualization; Gene Ontology; Hierarchical Clustering; Mappings; Interaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aleksakhin, V. (2012). Visualization of gene ontology and cluster analysis results. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21248

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):

Aleksakhin, Vladyslav. “Visualization of gene ontology and cluster analysis results.” 2012. Thesis, Linnaeus University. Accessed May 25, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21248.

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

MLA Handbook (7th Edition):

Aleksakhin, Vladyslav. “Visualization of gene ontology and cluster analysis results.” 2012. Web. 25 May 2019.

Vancouver:

Aleksakhin V. Visualization of gene ontology and cluster analysis results. [Internet] [Thesis]. Linnaeus University; 2012. [cited 2019 May 25]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21248.

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

Council of Science Editors:

Aleksakhin V. Visualization of gene ontology and cluster analysis results. [Thesis]. Linnaeus University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21248

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


University of Houston

29. Kotadia, Kinjal 1994-. Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering.

Degree: Computer Science, Department of, 2018, University of Houston

 Detecting Social Network Groups from Video data acquired from surveillance cameras is a challenging problem currently being addressed by the Data Mining and Computer Vision… (more)

Subjects/Keywords: Social Network Groups; Motion Similarity; Graph Clustering; Elbow Method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kotadia, K. 1. (2018). Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering. (Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3117

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):

Kotadia, Kinjal 1994-. “Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering.” 2018. Thesis, University of Houston. Accessed May 25, 2019. http://hdl.handle.net/10657/3117.

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

MLA Handbook (7th Edition):

Kotadia, Kinjal 1994-. “Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering.” 2018. Web. 25 May 2019.

Vancouver:

Kotadia K1. Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering. [Internet] [Thesis]. University of Houston; 2018. [cited 2019 May 25]. Available from: http://hdl.handle.net/10657/3117.

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

Council of Science Editors:

Kotadia K1. Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering. [Thesis]. University of Houston; 2018. Available from: http://hdl.handle.net/10657/3117

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


Kansas State University

30. Shakeri, Heman. Complex network analysis using modulus of families of walks.

Degree: PhD, Department of Electrical and Computer Engineering, 2017, Kansas State University

 The modulus of a family of walks quantifies the richness of the family by favoring having many short walks over a few longer ones. In… (more)

Subjects/Keywords: Complex networks; Modulus; Family of walks; Centrality; Graph theory; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shakeri, H. (2017). Complex network analysis using modulus of families of walks. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/35593

Chicago Manual of Style (16th Edition):

Shakeri, Heman. “Complex network analysis using modulus of families of walks.” 2017. Doctoral Dissertation, Kansas State University. Accessed May 25, 2019. http://hdl.handle.net/2097/35593.

MLA Handbook (7th Edition):

Shakeri, Heman. “Complex network analysis using modulus of families of walks.” 2017. Web. 25 May 2019.

Vancouver:

Shakeri H. Complex network analysis using modulus of families of walks. [Internet] [Doctoral dissertation]. Kansas State University; 2017. [cited 2019 May 25]. Available from: http://hdl.handle.net/2097/35593.

Council of Science Editors:

Shakeri H. Complex network analysis using modulus of families of walks. [Doctoral Dissertation]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/35593

[1] [2] [3] [4] [5]

.