subject:(Network Similarity Score NSS )

Indian Institute of Science

1. Gadiyaram, Vasundhara. Graph Spectral Methods for Analysis of Protein Structures.

Degree: PhD, Faculty of Science, 2019, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/4280

► Network representation of protein structures is an information-rich mode of examining protein structure, dynamics and its interactions with biomolecules. Graph spectral methods are extremely useful… (more)

Subjects/Keywords: Protein Structure Networks (PSN); Spectral Theory; Protein Structure Models; Spectral Graph Theory; G-Protein Coupled Receptors; Graph Spectral Method; Correspondence Score (CRS); Eigenvalue-Weighted Cosine Score (EWCS); Eigenvalue-Weighted Cosine Score (EWCS); Network Similarity Score (NSS); Mathematics

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gadiyaram, V. (2019). Graph Spectral Methods for Analysis of Protein Structures. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/4280

Chicago Manual of Style (16^th Edition):

Gadiyaram, Vasundhara. “Graph Spectral Methods for Analysis of Protein Structures.” 2019. Doctoral Dissertation, Indian Institute of Science. Accessed January 26, 2021. http://etd.iisc.ac.in/handle/2005/4280.

MLA Handbook (7^th Edition):

Gadiyaram, Vasundhara. “Graph Spectral Methods for Analysis of Protein Structures.” 2019. Web. 26 Jan 2021.

Vancouver:

Gadiyaram V. Graph Spectral Methods for Analysis of Protein Structures. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2019. [cited 2021 Jan 26]. Available from: http://etd.iisc.ac.in/handle/2005/4280.

Council of Science Editors:

Gadiyaram V. Graph Spectral Methods for Analysis of Protein Structures. [Doctoral Dissertation]. Indian Institute of Science; 2019. Available from: http://etd.iisc.ac.in/handle/2005/4280

Indian Institute of Science

2. Dighe, Anasuya. Studies on Dynamic Plasticity of Ligand Binding Sites in Proteins.

Degree: PhD, Faculty of Science, 2019, Indian Institute of Science

URL: http://etd.iisc.ac.in/handle/2005/4236

► Molecular recognition between proteins and their associated ligands constitutes ligand-induced protein rewiring thereby enabling the formation of a stable protein-ligand complex. The studies presented in… (more)

▼ Molecular recognition between proteins and their associated ligands constitutes ligand-induced protein rewiring thereby enabling the formation of a stable protein-ligand complex. The studies presented in this thesis address the conformational plasticity inherent to proteins by virtue of which they adapt to diverse ligands and orchestrate complex biological processes like signal transduction, transcription and protein-protein interaction. Adopting network theory based formalisms for understanding protein-ligand associations involve deconstructing the three-dimensional structure of a protein in terms of nodes and edges. With this view, Protein Structure Networks (PSNs) of ligand-bound complexes are studied by considering their side-chain non-covalent interactions. Agonist and antagonist-bound G-Protein Coupled Receptors (GPCRs) are investigated to gain mechanistic insights into allostery and its role in signal transduction. The degree of similarity between PSNs of these complexes is quantified by means of Network Similarity Score (NSS). The physical nature of these networks is inspected by subjecting them to perturbations and major players in maintaining the stability of such networks are identified. Residue-wise groupings (at backbone and side-chain level) are obtained by applying graph spectral methods. All-atom Molecular Dynamics (MD) simulations are carried out to gain a better understanding of protein-ligand binding by analysing conformational ensembles of these complexes. In this scenario, two members from a highly versatile ligand-inducible transcription factor superfamily, i.e., Nuclear Receptors (NR) are studied, that are known to exhibit extremes of ligand binding behavior ranging from promiscuity to specificity. Diverse ligands are known to bind to proteins and the overall nature of their binding site is investigated. In particular, similarities among binding sites of diverse proteins are analysed by using PocketMatch. Percolation of these similarities to regions surrounding the binding site is reported and examples depicting this extended similarity are discussed. Overall, studies presented in this thesis provide a structural perspective into the adaptability of proteins for recognizing diverse ligands and undergoing local or global re-organizations in their framework to regulate complex biological processes. Advisors/Committee Members: Vishveshwara, Saraswathi (advisor), Chandra, Nagasuma (advisor).

Subjects/Keywords: Protein-ligand Interactions; Protein Ligand Interactions; Protein Structure Networks (PSNs); Graph Theory; Protein Side-chain Networks (PScN); Muscarinic Acetylcholine Receptors; Muscarinic Receptor Cmplexes; Protein-Protein Interactions; Pregnane X Receptor; G-Protein Coupled Receptors (GPCRs); Network Similarity Score (NSS); Biochemistry

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dighe, A. (2019). Studies on Dynamic Plasticity of Ligand Binding Sites in Proteins. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/4236

Chicago Manual of Style (16^th Edition):

Dighe, Anasuya. “Studies on Dynamic Plasticity of Ligand Binding Sites in Proteins.” 2019. Doctoral Dissertation, Indian Institute of Science. Accessed January 26, 2021. http://etd.iisc.ac.in/handle/2005/4236.

MLA Handbook (7^th Edition):

Dighe, Anasuya. “Studies on Dynamic Plasticity of Ligand Binding Sites in Proteins.” 2019. Web. 26 Jan 2021.

Vancouver:

Dighe A. Studies on Dynamic Plasticity of Ligand Binding Sites in Proteins. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2019. [cited 2021 Jan 26]. Available from: http://etd.iisc.ac.in/handle/2005/4236.

Council of Science Editors:

Dighe A. Studies on Dynamic Plasticity of Ligand Binding Sites in Proteins. [Doctoral Dissertation]. Indian Institute of Science; 2019. Available from: http://etd.iisc.ac.in/handle/2005/4236

3. Mebratu, Ashagrie Kefyalew. Does religious similarity influence the direction of trade? : Evidence from US bilateral trade with other 168 countries.

Degree: Social Sciences, 2012, Södertörn University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-17478

► Despite interest in the influence of religion on economic activity by early economists like Adam Smith, modern economists have done little research on the… (more)

Subjects/Keywords: International trade; gravity model; similarity score; network theory and religion

…Does similarity in religion influence the direction of trade? (Empirical evidence… …the problem This essay would focus on an attempt to empirically test if religious similarity… …similarity influence the direction of trade? Is the effect of religious similarity significant on… …trade? (Based on a US bilateral trade with 168 countries) 8 Does similarity in… …identifying similarity is the limit. 9 Does similarity in religion influence the direction of…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Mebratu, A. K. (2012). Does religious similarity influence the direction of trade? : Evidence from US bilateral trade with other 168 countries. (Thesis). Södertörn University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-17478

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

Chicago Manual of Style (16^th Edition):

Mebratu, Ashagrie Kefyalew. “Does religious similarity influence the direction of trade? : Evidence from US bilateral trade with other 168 countries.” 2012. Thesis, Södertörn University. Accessed January 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-17478.

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

MLA Handbook (7^th Edition):

Mebratu, Ashagrie Kefyalew. “Does religious similarity influence the direction of trade? : Evidence from US bilateral trade with other 168 countries.” 2012. Web. 26 Jan 2021.

Vancouver:

Mebratu AK. Does religious similarity influence the direction of trade? : Evidence from US bilateral trade with other 168 countries. [Internet] [Thesis]. Södertörn University; 2012. [cited 2021 Jan 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-17478.

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

Council of Science Editors:

Mebratu AK. Does religious similarity influence the direction of trade? : Evidence from US bilateral trade with other 168 countries. [Thesis]. Södertörn University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-17478

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

Brno University of Technology

4. Nykrýn, Lukáš. Implementation of NIS Backend for SSSD: Implementation of NIS Backend for SSSD.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/53457

► The first part this thesis introduces technologies and tools for centralized management and authentication of users in GNU / Linux. It shows the usage of… (more)

Subjects/Keywords: bezpečnost; NIS; LDAP; SSSD; PAM; NSS; GNU/Linux; síťová autentizace; správa uživatelů; security; NIS; LDAP; SSSD; PAM; NSS; GNU/Linux; network authentication; user management

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nykrýn, L. (2019). Implementation of NIS Backend for SSSD: Implementation of NIS Backend for SSSD. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53457

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

Chicago Manual of Style (16^th Edition):

Nykrýn, Lukáš. “Implementation of NIS Backend for SSSD: Implementation of NIS Backend for SSSD.” 2019. Thesis, Brno University of Technology. Accessed January 26, 2021. http://hdl.handle.net/11012/53457.

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

MLA Handbook (7^th Edition):

Nykrýn, Lukáš. “Implementation of NIS Backend for SSSD: Implementation of NIS Backend for SSSD.” 2019. Web. 26 Jan 2021.

Vancouver:

Nykrýn L. Implementation of NIS Backend for SSSD: Implementation of NIS Backend for SSSD. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11012/53457.

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

Council of Science Editors:

Nykrýn L. Implementation of NIS Backend for SSSD: Implementation of NIS Backend for SSSD. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/53457

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

NSYSU

5. Tsai, Shian-Chi. A Mixed Approach for Multi-Label Document Classification.

Degree: Master, Electrical Engineering, 2010, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810110-175700

► Unlike single-label document classification, where each document exactly belongs to a single category, when the document is classified into two or more categories, known as… (more)

Subjects/Keywords: relevance score; information retrieval; Multi-Label document classification; fuzzy similarity measure

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Tsai, S. (2010). A Mixed Approach for Multi-Label Document Classification. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810110-175700

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

Chicago Manual of Style (16^th Edition):

Tsai, Shian-Chi. “A Mixed Approach for Multi-Label Document Classification.” 2010. Thesis, NSYSU. Accessed January 26, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810110-175700.

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

MLA Handbook (7^th Edition):

Tsai, Shian-Chi. “A Mixed Approach for Multi-Label Document Classification.” 2010. Web. 26 Jan 2021.

Vancouver:

Tsai S. A Mixed Approach for Multi-Label Document Classification. [Internet] [Thesis]. NSYSU; 2010. [cited 2021 Jan 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810110-175700.

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

Council of Science Editors:

Tsai S. A Mixed Approach for Multi-Label Document Classification. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810110-175700

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

University of Georgia

6. Emani, Savitha. A comparative evaluation of semantic Web service discovery algorithms and engines.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/25438

► As Web service technology becomes more prevalent, effective discovery becomes more important. Discovering Web services using UDDI can be difficult, since the discovery mechanism mostly… (more)

Subjects/Keywords: Discovery algorithms; match score; ontology; properties; semantics; similarity; syntax; web services.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Emani, S. (2014). A comparative evaluation of semantic Web service discovery algorithms and engines. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/25438

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

Chicago Manual of Style (16^th Edition):

Emani, Savitha. “A comparative evaluation of semantic Web service discovery algorithms and engines.” 2014. Thesis, University of Georgia. Accessed January 26, 2021. http://hdl.handle.net/10724/25438.

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

MLA Handbook (7^th Edition):

Emani, Savitha. “A comparative evaluation of semantic Web service discovery algorithms and engines.” 2014. Web. 26 Jan 2021.

Vancouver:

Emani S. A comparative evaluation of semantic Web service discovery algorithms and engines. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10724/25438.

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

Council of Science Editors:

Emani S. A comparative evaluation of semantic Web service discovery algorithms and engines. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/25438

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

Stellenbosch University

7. De Kock, Antonie Johannes. The study of similarity score calculation methods for minutia-based fingerprint matching algorithms.

Degree: MSc, Mathematical Sciences, 2016, Stellenbosch University

URL: http://hdl.handle.net/10019.1/100100

►

ENGLISH ABSTRACT : This study aims to establish guidelines for calculating the similarity score between two minutia point representations of ngerprints for minutia-based ngerprint matching.… (more)

▼

ENGLISH ABSTRACT : This study aims to establish guidelines for calculating the similarity score between two minutia point representations of ngerprints for minutia-based ngerprint matching. Existing research does not provide clear guidelines on how to calculate the similarity score between two minutia point representations and the reported performance of most existing algorithms include those comparisons for which the point matching algorithm failed. This study therefore compares the performance of existing similarity score calculation methods after the erroneous comparisons from the point matching algorithm have been removed. It furthermore investigates in which way and to what extent these methods are a ected by intra-class variations and inter-class similarities. The results indicate that none of the existing similarity score calculation methods is superior to all the others when implemented on the FVC2002 and FVC2004 ngerprint databases. This study also proposes an improved local descriptor for local similarity score calculation and investigates whether the combination of di erent types of similarity score calculation methods better addresses intraclass variations and inter-class similarities and therefore improves pro ciency. The results indicate that similarity score calculation methods that address both global and local inter-class similarities, and are robust to intra-class variations, perform better across multiple databases. Even though this study concludes that the combination of di erent types of similarity score calculation methods generally improves pro ciency, high levels of noise and nonlinear distortion still adversely a ect performance. Future work should therefore focus on improving the stages preceding the similarity score calculation stage, i.e. minutia extraction and point matching.

AFRIKAANSE OPSOMMING : Hierdie studie poog om riglyne vir die berekening van die eendersheidtelling tussen twee minutia-puntvoorstellings van vingerafdrukke vir minutiagebaseerde vingerafdrukpassing daar te stel. Bestaande navorsing verskaf nie duidelike riglyne vir hoe om die eendersheid-telling tussen twee minutia puntvoorstellings te bereken nie en die gerapporteerde prestasie vir die meeste bestaande algoritmes sluit daardie vergelykings waarvoor die puntpassingsalgoritme misluk in. Hierdie studie vergelyk dus die prestasie van bestaande eendersheid-telling berekeningsmetodes nadat die foutiewe vergelykings van die puntpassingsalgoritme verwyder is. Dit ondersoek ook op watter manier en in watter mate hierdie metodes deur intra-klas variasies en inter-klas ooreenstemmings beïnvloed word. Die resultate dui daarop dat geen van die bestaande eendersheid-telling berekeningsmetodes better as al die ander vaar wanneer dit op die FVC2002 en FVC2004 vingerafdruk databasisse geïmplementeer word nie. Hierdie studie stel ook 'n verbeterde lokale beskrywer vir lokale eendersheid-telling berekening voor en ondersoek of die kombinasie van verskillende eendersheid-telling…

Advisors/Committee Members: Coetzer, Johannes, Mathekga, Mmamolatelo E., Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences (Applied Mathematic).

Subjects/Keywords: Similarity score; Minutiae based matching; Matching algorithms; Fingerprints – Identification

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

De Kock, A. J. (2016). The study of similarity score calculation methods for minutia-based fingerprint matching algorithms. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/100100

Chicago Manual of Style (16^th Edition):

De Kock, Antonie Johannes. “The study of similarity score calculation methods for minutia-based fingerprint matching algorithms.” 2016. Masters Thesis, Stellenbosch University. Accessed January 26, 2021. http://hdl.handle.net/10019.1/100100.

MLA Handbook (7^th Edition):

De Kock, Antonie Johannes. “The study of similarity score calculation methods for minutia-based fingerprint matching algorithms.” 2016. Web. 26 Jan 2021.

Vancouver:

De Kock AJ. The study of similarity score calculation methods for minutia-based fingerprint matching algorithms. [Internet] [Masters thesis]. Stellenbosch University; 2016. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10019.1/100100.

Council of Science Editors:

De Kock AJ. The study of similarity score calculation methods for minutia-based fingerprint matching algorithms. [Masters Thesis]. Stellenbosch University; 2016. Available from: http://hdl.handle.net/10019.1/100100

University of Notre Dame

8. Jason M. Grant. Exploring the Structure of the Similarity Score Space</h1>.

Degree: Computer Science and Engineering, 2013, University of Notre Dame

URL: https://curate.nd.edu/show/5x21td98h2q

► Similarity scores in face recognition represent the proximity between pairs of images as computed by a matching algorithm. Given a large set of images… (more)

Subjects/Keywords: similarity score analysis; clustering; face recognition; biometrics; computer vision

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Grant, J. M. (2013). Exploring the Structure of the Similarity Score Space</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/5x21td98h2q

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

Chicago Manual of Style (16^th Edition):

Grant, Jason M.. “Exploring the Structure of the Similarity Score Space</h1>.” 2013. Thesis, University of Notre Dame. Accessed January 26, 2021. https://curate.nd.edu/show/5x21td98h2q.

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

MLA Handbook (7^th Edition):

Grant, Jason M.. “Exploring the Structure of the Similarity Score Space</h1>.” 2013. Web. 26 Jan 2021.

Vancouver:

Grant JM. Exploring the Structure of the Similarity Score Space</h1>. [Internet] [Thesis]. University of Notre Dame; 2013. [cited 2021 Jan 26]. Available from: https://curate.nd.edu/show/5x21td98h2q.

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

Council of Science Editors:

Grant JM. Exploring the Structure of the Similarity Score Space</h1>. [Thesis]. University of Notre Dame; 2013. Available from: https://curate.nd.edu/show/5x21td98h2q

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

University of Ottawa

9. Alfraidi, Hanadi Humoud A. Interactive System for Scientific Publication Visualization and Similarity Measurement based on Citation Network .

Degree: 2015, University of Ottawa

URL: http://hdl.handle.net/10393/33135

► Online scientific publications are becoming more and more popular. The number of publications we can access almost instantaneously is rapidly increasing. This makes it more… (more)

▼ Online scientific publications are becoming more and more popular. The number of publications we can access almost instantaneously is rapidly increasing. This makes it more challenging for researchers to pursue a topic, review literature, track research history or follow research trends. Using online resources such as search engines and digital libraries is helpful to find scientific publications, however most of the time the user ends up with an overwhelming amount of linear results to go through. This thesis proposes an alternative system, which takes advantage of citation/reference relations between publications. This demonstrates better insight of the hierarchy distribution of publications around a given topic. We also utilize information visualization techniques to represent the publications as a network. Our system is designed to automatically retrieve publications from Google Scholar and visualize them as a 2-dimensional graph representation using the citation relations. In this, the nodes represent the documents while the links represent the citation/reference relations between them. Our visualization system provides a better view of publications, making it easier to identify the research flow, connect publications, and assess similarities/differences between them. It is an interactive web based system, which allows the users to get more information about any selected publication and calculate a similarity score between two selected publications. Traditionally, similar documents are found using Natural Language Processing (NLP), which compares documents based on matching their contents. In the proposed method, similar documents are found using the citation/reference relations which are iii represented by the relationship that was originally inputted by the authors. We propose a new path based metric for measuring the similarity scores between any pair of publications. This is based on both the number of paths and the length of each path. More paths and shorter lengths increase the similarity score. We compare our similarity score results with another similarity score from Scurtu’s Document Similarity [1] that uses the NLP method. We then use the average of the similarity scores collected from 15 users as a ground truth to validate the efficiency of our method. The results indicate that our Citation Network approach yielded better scores than Scurtu’s approach.

Subjects/Keywords: Information Visualization; Citation Network; Similarity Measures; Document Similarity

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Alfraidi, H. H. A. (2015). Interactive System for Scientific Publication Visualization and Similarity Measurement based on Citation Network . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/33135

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

Chicago Manual of Style (16^th Edition):

Alfraidi, Hanadi Humoud A. “Interactive System for Scientific Publication Visualization and Similarity Measurement based on Citation Network .” 2015. Thesis, University of Ottawa. Accessed January 26, 2021. http://hdl.handle.net/10393/33135.

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

MLA Handbook (7^th Edition):

Alfraidi, Hanadi Humoud A. “Interactive System for Scientific Publication Visualization and Similarity Measurement based on Citation Network .” 2015. Web. 26 Jan 2021.

Vancouver:

Alfraidi HHA. Interactive System for Scientific Publication Visualization and Similarity Measurement based on Citation Network . [Internet] [Thesis]. University of Ottawa; 2015. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10393/33135.

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

Council of Science Editors:

Alfraidi HHA. Interactive System for Scientific Publication Visualization and Similarity Measurement based on Citation Network . [Thesis]. University of Ottawa; 2015. Available from: http://hdl.handle.net/10393/33135

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

University of Toronto

10. Mikhaylov, Andrey Olegovich. Integrating Biologic and Clinical Data towards Resolving Heterogeneity in Childhood Inflammatory Diseases.

Degree: 2016, University of Toronto

URL: http://hdl.handle.net/1807/75362

►

Kawasaki disease (KD) is the leading cause of acquired heart disease in children from the developed world, with up to 25% risk of developing aneurysms… (more)

Subjects/Keywords: Kawasaki Disease; Similarity Network Fusion; 0982

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Mikhaylov, A. O. (2016). Integrating Biologic and Clinical Data towards Resolving Heterogeneity in Childhood Inflammatory Diseases. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/75362

Chicago Manual of Style (16^th Edition):

Mikhaylov, Andrey Olegovich. “Integrating Biologic and Clinical Data towards Resolving Heterogeneity in Childhood Inflammatory Diseases.” 2016. Masters Thesis, University of Toronto. Accessed January 26, 2021. http://hdl.handle.net/1807/75362.

MLA Handbook (7^th Edition):

Mikhaylov, Andrey Olegovich. “Integrating Biologic and Clinical Data towards Resolving Heterogeneity in Childhood Inflammatory Diseases.” 2016. Web. 26 Jan 2021.

Vancouver:

Mikhaylov AO. Integrating Biologic and Clinical Data towards Resolving Heterogeneity in Childhood Inflammatory Diseases. [Internet] [Masters thesis]. University of Toronto; 2016. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1807/75362.

Council of Science Editors:

Mikhaylov AO. Integrating Biologic and Clinical Data towards Resolving Heterogeneity in Childhood Inflammatory Diseases. [Masters Thesis]. University of Toronto; 2016. Available from: http://hdl.handle.net/1807/75362

11. Dhillon, Gagandeep Kaur. Using Self Similarity for Detection of Rate based Network Anomalies;.

Degree: 2015, INFLIBNET

URL: http://shodhganga.inflibnet.ac.in/handle/10603/53229

including newline

Advisors/Committee Members: Saxena, Viskas and Gupta, J P.

Subjects/Keywords: Anomalies; Detection; Network; Self Similarity

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Dhillon, G. K. (2015). Using Self Similarity for Detection of Rate based Network Anomalies;. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/53229

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

Chicago Manual of Style (16^th Edition):

Dhillon, Gagandeep Kaur. “Using Self Similarity for Detection of Rate based Network Anomalies;.” 2015. Thesis, INFLIBNET. Accessed January 26, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/53229.

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

MLA Handbook (7^th Edition):

Dhillon, Gagandeep Kaur. “Using Self Similarity for Detection of Rate based Network Anomalies;.” 2015. Web. 26 Jan 2021.

Vancouver:

Dhillon GK. Using Self Similarity for Detection of Rate based Network Anomalies;. [Internet] [Thesis]. INFLIBNET; 2015. [cited 2021 Jan 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53229.

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

Council of Science Editors:

Dhillon GK. Using Self Similarity for Detection of Rate based Network Anomalies;. [Thesis]. INFLIBNET; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/53229

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

Penn State University

12. Chen, Hung-hsuan. Identifying Similar Objects in Social Networks and Digital Libraries.

Degree: 2013, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/19753

► With the rise of the computer age, various kinds of information can be easily accessed in digital format. However, the objects found within this information,… (more)

▼ With the rise of the computer age, various kinds of information can be easily accessed in digital format. However, the objects found within this information, such as people, places, dates, and firms, form a tangled and complex relationship that is usually challenging to untangle. In this dissertation, we aim to unravel the relationship among objects to the finest extent: what are the similarity levels between any pairs of objects. Discovering similar objects can be the foundation of several research problems and applications. For example, objects can be clustered into several groups by merging similar objects together. This merging process can be recursively performed such that a hierarchical structure of these terms is constructed. In addition, the hidden relationship among objects can be inferred by examining the similar objects that do not explicitly interact with each other. This dissertation examines the problem of discovering similar objects in two different settings: (1) discovering similar objects based on the interaction among them, and (2) discovering similar objects based on their meta-data. We will mainly focus on the first setting. The interactions among objects are modeled by a network structure, in which each node represents one object, and an edge is presented if the two objects have interacted with each other. In the second setting, we examine the similarity problem where additional information other than interacting history is available. In the second setting, we targeted digital library objects, such as papers, authors, published venues (i.e., the published conference or journal), etc. The meta-data of these objects could be, for example, the citation counts of the paper, the affiliation of the author, and the topics of the conference. These meta-data are utilized to infer the similar objects, such as similar terms, similar venues, or relevant authors given a topic. To validate our proposed models and methodologies, we conducted various experiments on several different data sets to discover the hidden relationship among the target objects. This includes (1) the relationship between the authors, papers, and venues in the given digital library, (2) the actors, actresses, and the movies in the given movie information, and (3) the diseases and the genes of patients. In addition, we implemented two live systems based on CiteSeerX digital library to bring several of these research results into practical products. The first system, CollabSeer, recommends potential collaborators based on a user's research interest and previous coauthoring behaviors. The second one, CSSeer, recommends a list of experts given a term of interest based on the similarity score between the query term and the publication and citation history of the authors. Both systems are highly efficient in handling more than one million papers and over 300 thousand disambiguated authors. Advisors/Committee Members: C Lee Giles, Dissertation Advisor/Co-Advisor, Robert T Collins, Committee Member, Wang Chien Lee, Committee Member, David Jonathan Miller, Committee Member.

Subjects/Keywords: link prediction; vertex similarity; expert search; social network

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chen, H. (2013). Identifying Similar Objects in Social Networks and Digital Libraries. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/19753

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

Chicago Manual of Style (16^th Edition):

Chen, Hung-hsuan. “Identifying Similar Objects in Social Networks and Digital Libraries.” 2013. Thesis, Penn State University. Accessed January 26, 2021. https://submit-etda.libraries.psu.edu/catalog/19753.

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

MLA Handbook (7^th Edition):

Chen, Hung-hsuan. “Identifying Similar Objects in Social Networks and Digital Libraries.” 2013. Web. 26 Jan 2021.

Vancouver:

Chen H. Identifying Similar Objects in Social Networks and Digital Libraries. [Internet] [Thesis]. Penn State University; 2013. [cited 2021 Jan 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/19753.

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

Council of Science Editors:

Chen H. Identifying Similar Objects in Social Networks and Digital Libraries. [Thesis]. Penn State University; 2013. Available from: https://submit-etda.libraries.psu.edu/catalog/19753

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

Boston University

13. Bak, Daniel. A study of the CDGSH protein family: biophysical and bioinformatic analysis of the [2FE-2S] cluster protein mitoneet.

Degree: PhD, Molecular Biology, Cell Biology & Biochemistry, 2014, Boston University

URL: http://hdl.handle.net/2144/15236

► Iron-sulfur clusters, an important class of redox active cofactors, are ligated by protein-based Cys ligands in a variety of nuclearities. Traditionally, these clusters serve as… (more)

▼ Iron-sulfur clusters, an important class of redox active cofactors, are ligated by protein-based Cys ligands in a variety of nuclearities. Traditionally, these clusters serve as one-electron transfer units, though many clusters are capable of catalytic activity and sensing functions. Recently, a greater number of iron-sulfur clusters with non-Cys ligation have been identified, wherein one or more of the Cys ligands are replaced by an alternative amino acid residue such as His or Asp. In most cases the role of this ligand substitution is unknown. Some hypotheses are that non-Cys ligation may modify reduction potential, allow for proton-coupled electron transfer, or modulate cluster stability. The human mitoNEET protein contains a 1-His, 3-Cys ligated [2Fe-2S] cluster, identified by the presence of a CDGSH peptide motif. MitoNEET is a binding target for the type II-diabetes drug, pioglitazone, and is implicated in controlling mitochondrial iron levels. How exactly mitoNEET functions in the cell is unknown, as is the role its uniquely ligated FeS cluster may play. This thesis uses mitoNEET as a model for the study of non-Cys ligated FeS clusters and their biological function. Protein film voltammetry was used to examine the pH-dependent electrochemical properties of the mitoNEET cluster, indicating that multiple as yet unidentified protonations control redox potential and that drug binding impacts cluster reduction and protonation. Additionally, the effect of reduction and protonation on cluster and protein structure instability was examined through absorbance and circular dichroism measurements, suggesting an important role for cluster lability in protein function. The CDGSH-motif family of [2Fe-2S] cluster-binding proteins was examined using protein similarity networks. This technique highlights the evolutionary relationship among these proteins, and has led to further work examining the DUF1271 domain containing proteins E. coli YjdI and A. vinosum Alvin0680 (a CDGSH-DUF1271 fusion). This work furthers the scientific knowledge of non-Cys ligated Fe-S clusters by improving our understanding of how the mitoNEET His-ligand contributes to proton-coupled electron transfer and cluster instability, and how the broader class of CDGSH-motif proteins is organized.

Subjects/Keywords: Biochemistry; CDGSH; YjdI; Iron-sulfur; MitoNEET; Protein similarity network

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bak, D. (2014). A study of the CDGSH protein family: biophysical and bioinformatic analysis of the [2FE-2S] cluster protein mitoneet. (Doctoral Dissertation). Boston University. Retrieved from http://hdl.handle.net/2144/15236

Chicago Manual of Style (16^th Edition):

Bak, Daniel. “A study of the CDGSH protein family: biophysical and bioinformatic analysis of the [2FE-2S] cluster protein mitoneet.” 2014. Doctoral Dissertation, Boston University. Accessed January 26, 2021. http://hdl.handle.net/2144/15236.

MLA Handbook (7^th Edition):

Bak, Daniel. “A study of the CDGSH protein family: biophysical and bioinformatic analysis of the [2FE-2S] cluster protein mitoneet.” 2014. Web. 26 Jan 2021.

Vancouver:

Bak D. A study of the CDGSH protein family: biophysical and bioinformatic analysis of the [2FE-2S] cluster protein mitoneet. [Internet] [Doctoral dissertation]. Boston University; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2144/15236.

Council of Science Editors:

Bak D. A study of the CDGSH protein family: biophysical and bioinformatic analysis of the [2FE-2S] cluster protein mitoneet. [Doctoral Dissertation]. Boston University; 2014. Available from: http://hdl.handle.net/2144/15236

University of Houston

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

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

URL: http://hdl.handle.net/10657/3117

► 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 Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

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

Chicago Manual of Style (16^th Edition):

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

MLA Handbook (7^th Edition):

Kotadia, Kinjal 1994-. “Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering.” 2018. Web. 26 Jan 2021.

Vancouver:

Kotadia K1. Extracting Social Network Groups from Video Data Using Motion Similarity and Network Clustering. [Internet] [Masters thesis]. University of Houston; 2018. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10657/3117.

Council of Science Editors:

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

George Mason University

15. Wang, Caixia. Spatial Content-Based Scene Matching Using a Relaxation Method .

Degree: 2011, George Mason University

URL: http://hdl.handle.net/1920/6357

► Scene matching is a fundamental task for a variety of geospatial analysis applications. As we move towards multi-source data analysis, constantly increasing amounts of generated… (more)

▼ Scene matching is a fundamental task for a variety of geospatial analysis applications. As we move towards multi-source data analysis, constantly increasing amounts of generated geospatial datasets and the diversification of data sources are the two major forces driving the need for novel and more efficient matching solutions. Despite the great effort within the geospatial and computer science communities, automated scene matching still remains crucial and challenging when vector data are involved such as image-to-map registration for change detection. In this context, features extracted from vector data contain no intensity information which typically is the significant component in current promising approaches for registration. This problem becomes increasingly complicated as the two or more datasets usually present differences in coverage, scale, or orientation in general, and accordingly corresponding objects in the two or more datasets may also differ to a certain extent. This dissertation developed a novel methodology for automatic image-to-vector matching, based on contextual information among salient spatial features (e.g. road networks and buildings) in a scene. In this work, we model the road networks extracted from the two to-be-matched datasets as attributed graphs. The developed attribute metric measures the geometric and topological properties of the road network, which are invariant to the differences of the two datasets in scale, orientation, area of coverage, physical changes and extraction errors. Road networks comprise line segments (or curves), intersections and loops. Such complex structure suggests versatile attributes derivable from the components themselves of the road networks as well as between these components. It is important to develop attributes that need less computational efforts, while having sufficient descriptive power. We extend the entropy concept to statistically measure the descriptive quality of the attributes under consideration. Subsequently, by considering the spatial distribution and structure similarity in a neighborhood, we formulate a global compatibility in a relaxation manner to measure the overall goodness of correspondence. An optimal matching is achieved by finding an optimal morphism that maximizes this compatibility function. In this work, we further extend the invariant metric to incorporate additional scene content (i.e. buildings) in the form of object configurations present within individual road network loops (e.g. as they may become available from other GIS layers). For the local similarity, we developed an assessment framework to quantitatively measure the similarity of spatial configuration, where there is no need for semantic information (e.g. names) for buildings, a prior information necessary for spatial scene similarity in many alternative approaches. By combining diverse but co-located pieces of information (e.g. roads and buildings) in an integrated process, this multilayer scene matching allows us to integrate… Advisors/Committee Members: Stefanidis, Anthony (advisor).

Subjects/Keywords: Similarity; Scene Matching; Graph; Road Network; Imagery; Feature

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wang, C. (2011). Spatial Content-Based Scene Matching Using a Relaxation Method . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/6357

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

Chicago Manual of Style (16^th Edition):

Wang, Caixia. “Spatial Content-Based Scene Matching Using a Relaxation Method .” 2011. Thesis, George Mason University. Accessed January 26, 2021. http://hdl.handle.net/1920/6357.

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

MLA Handbook (7^th Edition):

Wang, Caixia. “Spatial Content-Based Scene Matching Using a Relaxation Method .” 2011. Web. 26 Jan 2021.

Vancouver:

Wang C. Spatial Content-Based Scene Matching Using a Relaxation Method . [Internet] [Thesis]. George Mason University; 2011. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1920/6357.

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

Council of Science Editors:

Wang C. Spatial Content-Based Scene Matching Using a Relaxation Method . [Thesis]. George Mason University; 2011. Available from: http://hdl.handle.net/1920/6357

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

University of Illinois – Urbana-Champaign

16. Bouvier, Jason T. Functional discovery in the oxidative D-galacturonate assimilation pathway and development of the enzyme similarity web tool.

Degree: PhD, Biochemistry, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/88275

► Sequencing technology has improved dramatically over the past few decades. Before the sequencing of complete genomes was possible, the sequencing of a gene was directly… (more)

▼ Sequencing technology has improved dramatically over the past few decades. Before the sequencing of complete genomes was possible, the sequencing of a gene was directly linked to the biochemical characterization of its product [1], however biochemical and genetic characterization has not benefited from being scaled up in the same way as has sequencing. Thus, the scientific community is confronted with exponentially growing sequence databases in which roughly half of the entries are either annotated incorrectly or not at all. Therefore, in order to realize the true potential of the data being generated by sequencing projects, something must be done about the way the functions of those sequences are being discovered and identified. One approach to addressing the problem of the growing number of sequences without a known function is that set forth by the Enzyme Function Initiative (EFI). The goal of the EFI is to develop tools and strategies to characterize enzymes discovered in genome projects, and the EFI uses an interdisciplinary approach to address the problem. EFI labs include those with expertise in bioinformatics, computational biology, structural biology, enzymology, and biology, that work together to develop a systematic approach that starts with using bioinformatics to select enzyme candidates for structural elucidation, ligand docking to identify potential substrates, in vitro biochemistry to test those predictions, and microbiology to test for the physiological role of activities identified in vitro. The approach just described is the general approach taken, but other tools and approaches also have been tested and developed in each of the areas mentioned (e.g., bioinformatics, computational biology). Bioinformatics tools that have been further developed include sequence similarity networks (SSNs) and genomic context networks. SSNs have a long history and are useful in visualizing trends across groups of related protein sequences, namely function. Before this work, access to SSNs by experimentalists with little bioinformatics training was limited. To provide the ability for experimentalist to generate an SSN for any protein family (~16,000 now in Pfam), we developed a web tool to generate SSNs quickly and easily. The networks can be viewed in Cytoscape and contain an aggregate of annotation data pulled from different sources (e.g., UniProt, GenomesOnline). The first part of this work (Chapter 2) describes the web tool and provides an example in which members of the enolase superfamily from Agrobacterium tumefaciens strain C58 are mined in a shotgun approach to discover novel enzymatic activities. In the second part of this work, combined bioinformatics and experimental approaches are used to identify two novel enzymes in the oxidative pathway to degrade pectin, the abundant plant cell wall polysaccharide. In the first example (Chapter 3), genomic context and pathway reconstruction combined with in vitro biochemistry and gene expression analysis reveal a novel enzymatic activity of isomerizing the… Advisors/Committee Members: Gerlt, John A. (advisor), Gerlt, John A. (Committee Chair), Cronan, John E. (committee member), Nair, Satish K. (committee member), Orlean, Peter A. (committee member).

Subjects/Keywords: Hexuronate degradation; sequence similarity network; Enzyme Function Initiative

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Bouvier, J. T. (2015). Functional discovery in the oxidative D-galacturonate assimilation pathway and development of the enzyme similarity web tool. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88275

Chicago Manual of Style (16^th Edition):

Bouvier, Jason T. “Functional discovery in the oxidative D-galacturonate assimilation pathway and development of the enzyme similarity web tool.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 26, 2021. http://hdl.handle.net/2142/88275.

MLA Handbook (7^th Edition):

Bouvier, Jason T. “Functional discovery in the oxidative D-galacturonate assimilation pathway and development of the enzyme similarity web tool.” 2015. Web. 26 Jan 2021.

Vancouver:

Bouvier JT. Functional discovery in the oxidative D-galacturonate assimilation pathway and development of the enzyme similarity web tool. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/2142/88275.

Council of Science Editors:

Bouvier JT. Functional discovery in the oxidative D-galacturonate assimilation pathway and development of the enzyme similarity web tool. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88275

Brock University

17. Harrison, Kyle Robert. Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming .

Degree: Department of Computer Science, 2014, Brock University

URL: http://hdl.handle.net/10464/5679

► A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex… (more)

Subjects/Keywords: Graph Models; Complex Networks; Genetic Programming; Automatic Construction; Network Similarity

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Harrison, K. R. (2014). Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming . (Thesis). Brock University. Retrieved from http://hdl.handle.net/10464/5679

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

Chicago Manual of Style (16^th Edition):

Harrison, Kyle Robert. “Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming .” 2014. Thesis, Brock University. Accessed January 26, 2021. http://hdl.handle.net/10464/5679.

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

MLA Handbook (7^th Edition):

Harrison, Kyle Robert. “Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming .” 2014. Web. 26 Jan 2021.

Vancouver:

Harrison KR. Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming . [Internet] [Thesis]. Brock University; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10464/5679.

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

Council of Science Editors:

Harrison KR. Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming . [Thesis]. Brock University; 2014. Available from: http://hdl.handle.net/10464/5679

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

18. Holmberg, Martin. Bayesian Network Fisher Kernel for Categorical Feature Spaces .

Degree: Chalmers tekniska högskola / Institutionen för data och informationsteknik, 2019, Chalmers University of Technology

URL: http://hdl.handle.net/20.500.12380/300393

► Similarity measures between categorical feature vectors are non-intuitive and diﬃcult to compute, since no deﬁnitive way of representing distances between two such vectors exists. The… (more)

Subjects/Keywords: Bayesian network; Fisher kernel; kernel; clustering; imputation; categorical; similarity; machine learning

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Holmberg, M. (2019). Bayesian Network Fisher Kernel for Categorical Feature Spaces . (Thesis). Chalmers University of Technology. Retrieved from http://hdl.handle.net/20.500.12380/300393

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

Chicago Manual of Style (16^th Edition):

Holmberg, Martin. “Bayesian Network Fisher Kernel for Categorical Feature Spaces .” 2019. Thesis, Chalmers University of Technology. Accessed January 26, 2021. http://hdl.handle.net/20.500.12380/300393.

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

MLA Handbook (7^th Edition):

Holmberg, Martin. “Bayesian Network Fisher Kernel for Categorical Feature Spaces .” 2019. Web. 26 Jan 2021.

Vancouver:

Holmberg M. Bayesian Network Fisher Kernel for Categorical Feature Spaces . [Internet] [Thesis]. Chalmers University of Technology; 2019. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/20.500.12380/300393.

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

Council of Science Editors:

Holmberg M. Bayesian Network Fisher Kernel for Categorical Feature Spaces . [Thesis]. Chalmers University of Technology; 2019. Available from: http://hdl.handle.net/20.500.12380/300393

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

Universidade do Rio Grande do Sul

19. Nunes, Marcos Freitas. Avaliação experimental de uma técnica de padronização de escores de similaridade.

Degree: 2009, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/25494

►

Com o crescimento e a facilidade de acesso a Internet, o volume de dados cresceu muito nos últimos anos e, consequentemente, ficou muito fácil o… (more)

▼

Com o crescimento e a facilidade de acesso a Internet, o volume de dados cresceu muito nos últimos anos e, consequentemente, ficou muito fácil o acesso a bases de dados remotas, permitindo integrar dados fisicamente distantes. Geralmente, instâncias de um mesmo objeto no mundo real, originadas de bases distintas, apresentam diferenças na representação de seus valores, ou seja, os mesmos dados no mundo real podem ser representados de formas diferentes. Neste contexto, surgiram os estudos sobre casamento aproximado utilizando funções de similaridade. Por consequência, surgiu a dificuldade de entender os resultados das funções e selecionar limiares ideais. Quando se trata de casamento de agregados (registros), existe o problema de combinar os escores de similaridade, pois funções distintas possuem distribuições diferentes. Com objetivo de contornar este problema, foi desenvolvida em um trabalho anterior uma técnica de padronização de escores, que propõe substituir o escore calculado pela função de similaridade por um escore ajustado (calculado através de um treinamento), o qual é intuitivo para o usuário e pode ser combinado no processo de casamento de registros. Tal técnica foi desenvolvida por uma aluna de doutorado do grupo de Banco de Dados da UFRGS e será chamada aqui de MeaningScore (DORNELES et al., 2007). O presente trabalho visa estudar e realizar uma avaliação experimental detalhada da técnica MeaningScore. Com o final do processo de avaliação aqui executado, é possível afirmar que a utilização da abordagem MeaningScore é válida e retorna melhores resultados. No processo de casamento de registros, onde escores de similaridades distintos devem ser combinados, a utilização deste escore padronizado ao invés do escore original, retornado pela função de similaridade, produz resultados com maior qualidade.

With the growth of the Web, the volume of information grew considerably over the past years, and consequently, the access to remote databases became easier, which allows the integration of distributed information. Usually, instances of the same object in the real world, originated from distinct databases, present differences in the representation of their values, which means that the same information can be represented in different ways. In this context, research on approximate matching using similarity functions arises. As a consequence, there is a need to understand the result of the functions and to select ideal thresholds. Also, when matching records, there is the problem of combining the similarity scores, since distinct functions have different distributions. With the purpose of overcoming this problem, a previous work developed a technique that standardizes the scores, by replacing the computed score by an adjusted score (computed through a training), which is more intuitive for the user and can be combined in the process of record matching. This work was developed by a Phd student from the UFRGS database research group, and is referred to as MeaningScore (DORNELES et al., 2007). The present work…

Advisors/Committee Members: Heuser, Carlos Alberto.

Subjects/Keywords: Armazenamento : Dados; Similarity querying; Data integration; Banco : Dados; Métricas : Similaridade; Data cleaning; Consulta : Similaridade; Record matching; Adjusted score; Data quality

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Nunes, M. F. (2009). Avaliação experimental de uma técnica de padronização de escores de similaridade. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/25494

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

Chicago Manual of Style (16^th Edition):

Nunes, Marcos Freitas. “Avaliação experimental de uma técnica de padronização de escores de similaridade.” 2009. Thesis, Universidade do Rio Grande do Sul. Accessed January 26, 2021. http://hdl.handle.net/10183/25494.

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

MLA Handbook (7^th Edition):

Nunes, Marcos Freitas. “Avaliação experimental de uma técnica de padronização de escores de similaridade.” 2009. Web. 26 Jan 2021.

Vancouver:

Nunes MF. Avaliação experimental de uma técnica de padronização de escores de similaridade. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2009. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10183/25494.

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

Council of Science Editors:

Nunes MF. Avaliação experimental de uma técnica de padronização de escores de similaridade. [Thesis]. Universidade do Rio Grande do Sul; 2009. Available from: http://hdl.handle.net/10183/25494

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

University of Windsor

20. Suresh, Susha Pozhampallan. Attributed Graph Classification via Deep Graph Convolutional Neural Networks.

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

URL: https://scholar.uwindsor.ca/etd/8152

► From social networks to biological networks, graphs are a natural way to represent a diverse set of real-world data. This research presents attributed graph convolutional… (more)

Subjects/Keywords: Deep Neural Network; Gene Interaction Network; Gleason Score prediction; Graph Convolutional Neural Networks

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Suresh, S. P. (2019). Attributed Graph Classification via Deep Graph Convolutional Neural Networks. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/8152

Chicago Manual of Style (16^th Edition):

Suresh, Susha Pozhampallan. “Attributed Graph Classification via Deep Graph Convolutional Neural Networks.” 2019. Masters Thesis, University of Windsor. Accessed January 26, 2021. https://scholar.uwindsor.ca/etd/8152.

MLA Handbook (7^th Edition):

Suresh, Susha Pozhampallan. “Attributed Graph Classification via Deep Graph Convolutional Neural Networks.” 2019. Web. 26 Jan 2021.

Vancouver:

Suresh SP. Attributed Graph Classification via Deep Graph Convolutional Neural Networks. [Internet] [Masters thesis]. University of Windsor; 2019. [cited 2021 Jan 26]. Available from: https://scholar.uwindsor.ca/etd/8152.

Council of Science Editors:

Suresh SP. Attributed Graph Classification via Deep Graph Convolutional Neural Networks. [Masters Thesis]. University of Windsor; 2019. Available from: https://scholar.uwindsor.ca/etd/8152

University of Georgia

21. Chen, Feng. Similarity analysis of video sequences using an artificial neural network.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/20744

► Comparison of video sequences is an important operation in many multimedia information systems. The similarity measure for comparison is based on some measure of correlation… (more)

Subjects/Keywords: Video similarity; Similarity matching; Video shot; Mosaic image; Key frame; Individual feature; Feature combination; Artificial neural network.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chen, F. (2014). Similarity analysis of video sequences using an artificial neural network. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/20744

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

Chicago Manual of Style (16^th Edition):

Chen, Feng. “Similarity analysis of video sequences using an artificial neural network.” 2014. Thesis, University of Georgia. Accessed January 26, 2021. http://hdl.handle.net/10724/20744.

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

MLA Handbook (7^th Edition):

Chen, Feng. “Similarity analysis of video sequences using an artificial neural network.” 2014. Web. 26 Jan 2021.

Vancouver:

Chen F. Similarity analysis of video sequences using an artificial neural network. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10724/20744.

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

Council of Science Editors:

Chen F. Similarity analysis of video sequences using an artificial neural network. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/20744

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

University of Illinois – Chicago

22. Wang, Guan. Graph-Based Approach on Social Data Mining.

Degree: 2014, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/19011

► Powered by big data infrastructures, social network platforms are gathering data on many aspects of our daily lives. The online social world is reflecting our… (more)

Subjects/Keywords: graph algorithms; social network; store review spam detection; similarity and influence; magnet community; orgchart

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wang, G. (2014). Graph-Based Approach on Social Data Mining. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/19011

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

Chicago Manual of Style (16^th Edition):

Wang, Guan. “Graph-Based Approach on Social Data Mining.” 2014. Thesis, University of Illinois – Chicago. Accessed January 26, 2021. http://hdl.handle.net/10027/19011.

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

MLA Handbook (7^th Edition):

Wang, Guan. “Graph-Based Approach on Social Data Mining.” 2014. Web. 26 Jan 2021.

Vancouver:

Wang G. Graph-Based Approach on Social Data Mining. [Internet] [Thesis]. University of Illinois – Chicago; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10027/19011.

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

Council of Science Editors:

Wang G. Graph-Based Approach on Social Data Mining. [Thesis]. University of Illinois – Chicago; 2014. Available from: http://hdl.handle.net/10027/19011

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

University of Toronto

23. Stefanik, Laura Nicole. The Behavioural and Neural Correlates of Social Cognition: A Dimensional Approach in Youth with Mental Illness.

Degree: 2017, University of Toronto

URL: http://hdl.handle.net/1807/79368

►

Heterogeneity in social cognitive performance and social function is a major obstacle in the identification of consistent biomarkers of impairment for schizophrenia spectrum disorders (SSD),… (more)

Subjects/Keywords: Clustering; Similarity Network Fusion; Social Cognition; Structural MRI; Subtyping; Youth Mental Health; 0317

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Stefanik, L. N. (2017). The Behavioural and Neural Correlates of Social Cognition: A Dimensional Approach in Youth with Mental Illness. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/79368

Chicago Manual of Style (16^th Edition):

Stefanik, Laura Nicole. “The Behavioural and Neural Correlates of Social Cognition: A Dimensional Approach in Youth with Mental Illness.” 2017. Masters Thesis, University of Toronto. Accessed January 26, 2021. http://hdl.handle.net/1807/79368.

MLA Handbook (7^th Edition):

Stefanik, Laura Nicole. “The Behavioural and Neural Correlates of Social Cognition: A Dimensional Approach in Youth with Mental Illness.” 2017. Web. 26 Jan 2021.

Vancouver:

Stefanik LN. The Behavioural and Neural Correlates of Social Cognition: A Dimensional Approach in Youth with Mental Illness. [Internet] [Masters thesis]. University of Toronto; 2017. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/1807/79368.

Council of Science Editors:

Stefanik LN. The Behavioural and Neural Correlates of Social Cognition: A Dimensional Approach in Youth with Mental Illness. [Masters Thesis]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/79368

Univerzitet u Beogradu

24. Mišić, Marko J., 1984-. Унапређења система за детекцију плагијаризма у изворном програмском коду.

Degree: 2017, Univerzitet u Beogradu

URL: https://fedorabg.bg.ac.rs/fedora/get/o:15828/bdef:Content/get

►

Електротехника и рачунарство - Рачунарска техника и информатика / Electrical Engineering and Computing - Computer Engineering and Informatics

Образовање у области рачунарства укључује практичан рад… (more)

Subjects/Keywords: CUDA; parallelization; plagiarism; similarity detection; social network analysis; software systems; source code; visualization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Mišić, Marko J., 1. (2017). Унапређења система за детекцију плагијаризма у изворном програмском коду. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15828/bdef:Content/get

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

Chicago Manual of Style (16^th Edition):

Mišić, Marko J., 1984-. “Унапређења система за детекцију плагијаризма у изворном програмском коду.” 2017. Thesis, Univerzitet u Beogradu. Accessed January 26, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:15828/bdef:Content/get.

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

MLA Handbook (7^th Edition):

Mišić, Marko J., 1984-. “Унапређења система за детекцију плагијаризма у изворном програмском коду.” 2017. Web. 26 Jan 2021.

Vancouver:

Mišić, Marko J. 1. Унапређења система за детекцију плагијаризма у изворном програмском коду. [Internet] [Thesis]. Univerzitet u Beogradu; 2017. [cited 2021 Jan 26]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15828/bdef:Content/get.

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

Council of Science Editors:

Mišić, Marko J. 1. Унапређења система за детекцију плагијаризма у изворном програмском коду. [Thesis]. Univerzitet u Beogradu; 2017. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15828/bdef:Content/get

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

University of California – San Francisco

25. Yunes, Jeffrey Michael. Prediction of Protein Function with a Probabilistic Model for Analysis of Sequence Similarity Networks and Genomic Context.

Degree: Bioengineering, 2018, University of California – San Francisco

URL: http://www.escholarship.org/uc/item/2rr61756

► The number of known protein sequences is growing faster than the number of curated protein functions. To help bridge this gap, bioinformatics scientists have created… (more)

▼ The number of known protein sequences is growing faster than the number of curated protein functions. To help bridge this gap, bioinformatics scientists have created automated methods for the prediction of protein function. Recently, the focus has been on integrating numerous data sources, and critical evaluation of these methods show that the integrative approach improves predictive performance. However, a basic BLAST-based method is still a top contender.Computational biologists often use two complimentary approaches to infer functions that are usually more accurate than a BLAST-based method. Analysis of sequence similarity networks can dissect protein functions in a superfamily and infer the function of individual proteins. Briefly, a computational biologist will create a network of proteins in sequence space, which typically shows clusters of similar proteins. She will then highlight which few of these proteins have experimental functional annotations, and paint the network according to other functional features that are broadly available, such as residues in key positions in an alignment. These data are used to identify proteins where a functional change may have occurred, which then can be used to delineate protein families or other protein groups that share a specific function or functional characteristic. However, molecular functional annotation data are very scarce, and there is not enough of it to draw functional boundaries with high confidence.The second method, analysis of genomic context, is often done in conjunction with sequence similarity network analysis. This approach uses data about the genome neighbors of a protein, or more generally, any functional association data, such protein – protein interaction data, to predict a protein's molecular function. This technique has been used to refine functional boundaries during sequence similarity network analysis, as well as to generate hypothesis in the absence of characterization of any close homologs.In this dissertation, I describe Effusion, our attempt to automate sequence similarity network analysis and improve on the current methods for the prediction of protein function. Effusion modernizes the classical BLAST-based approach while avoiding pitfalls common to state-of-the-art methods. It uses a sequence similarity network to add context for homology transfer, a probabilistic model to account for the uncertainty in labels and function propagation, and the structure of the Gene Ontology to best utilize sparse input labels and make consistent output predictions. Effusion's model makes it practical to integrate rare experimental data with the abundant primary sequence and sequence similarity data. Our model allows for inference with general purpose, state-of-the-art inference algorithms, makes use of all experimental annotation data, has parameters specific to each Gene Ontology term, and adds data-derived pseudocounts to predict rare terms.Effusion GCA extends Effusion by integrating the chief components necessary for automating genomic context…

Subjects/Keywords: Bioinformatics; genomic context analysis; probabilistic graphical model; protein function prediction; sequence similarity network

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yunes, J. M. (2018). Prediction of Protein Function with a Probabilistic Model for Analysis of Sequence Similarity Networks and Genomic Context. (Thesis). University of California – San Francisco. Retrieved from http://www.escholarship.org/uc/item/2rr61756

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

Chicago Manual of Style (16^th Edition):

Yunes, Jeffrey Michael. “Prediction of Protein Function with a Probabilistic Model for Analysis of Sequence Similarity Networks and Genomic Context.” 2018. Thesis, University of California – San Francisco. Accessed January 26, 2021. http://www.escholarship.org/uc/item/2rr61756.

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

MLA Handbook (7^th Edition):

Yunes, Jeffrey Michael. “Prediction of Protein Function with a Probabilistic Model for Analysis of Sequence Similarity Networks and Genomic Context.” 2018. Web. 26 Jan 2021.

Vancouver:

Yunes JM. Prediction of Protein Function with a Probabilistic Model for Analysis of Sequence Similarity Networks and Genomic Context. [Internet] [Thesis]. University of California – San Francisco; 2018. [cited 2021 Jan 26]. Available from: http://www.escholarship.org/uc/item/2rr61756.

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

Council of Science Editors:

Yunes JM. Prediction of Protein Function with a Probabilistic Model for Analysis of Sequence Similarity Networks and Genomic Context. [Thesis]. University of California – San Francisco; 2018. Available from: http://www.escholarship.org/uc/item/2rr61756

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

Delft University of Technology

26. Melia, T. (author). Automated metabolic network reconstruction by exploiting functional homology.

Degree: 2009, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:23ca7642-eea4-45d2-a0a1-9858af9f290d

►

As the metabolic network reconstruction process via manual curation proves to be a tedious process, the need for an automated reconstruction tool becomes imminent. There… (more)

Subjects/Keywords: metabolic network reconstruction; homology; sequence similarity

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Melia, T. (. (2009). Automated metabolic network reconstruction by exploiting functional homology. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:23ca7642-eea4-45d2-a0a1-9858af9f290d

Chicago Manual of Style (16^th Edition):

Melia, T (author). “Automated metabolic network reconstruction by exploiting functional homology.” 2009. Masters Thesis, Delft University of Technology. Accessed January 26, 2021. http://resolver.tudelft.nl/uuid:23ca7642-eea4-45d2-a0a1-9858af9f290d.

MLA Handbook (7^th Edition):

Melia, T (author). “Automated metabolic network reconstruction by exploiting functional homology.” 2009. Web. 26 Jan 2021.

Vancouver:

Melia T(. Automated metabolic network reconstruction by exploiting functional homology. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2021 Jan 26]. Available from: http://resolver.tudelft.nl/uuid:23ca7642-eea4-45d2-a0a1-9858af9f290d.

Council of Science Editors:

Melia T(. Automated metabolic network reconstruction by exploiting functional homology. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:23ca7642-eea4-45d2-a0a1-9858af9f290d

Texas State University – San Marcos

27. Xu, Yuan. Social-similarity-based Multicast Routing Algorithms in Impromptu Mobile Social Networks.

Degree: MS, Computer Science, 2014, Texas State University – San Marcos

URL: https://digital.library.txstate.edu/handle/10877/5334

► Mobile Social Networks (MSNs) where people contact each other through mobile devices have become increasingly popular. In this thesis, we study a special kind of… (more)

Subjects/Keywords: Multicast; Mobile social network; Social similarity; Mobile computing; Online social networks; Computer networks; Computer algorithms

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Xu, Y. (2014). Social-similarity-based Multicast Routing Algorithms in Impromptu Mobile Social Networks. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/5334

Chicago Manual of Style (16^th Edition):

Xu, Yuan. “Social-similarity-based Multicast Routing Algorithms in Impromptu Mobile Social Networks.” 2014. Masters Thesis, Texas State University – San Marcos. Accessed January 26, 2021. https://digital.library.txstate.edu/handle/10877/5334.

MLA Handbook (7^th Edition):

Xu, Yuan. “Social-similarity-based Multicast Routing Algorithms in Impromptu Mobile Social Networks.” 2014. Web. 26 Jan 2021.

Vancouver:

Xu Y. Social-similarity-based Multicast Routing Algorithms in Impromptu Mobile Social Networks. [Internet] [Masters thesis]. Texas State University – San Marcos; 2014. [cited 2021 Jan 26]. Available from: https://digital.library.txstate.edu/handle/10877/5334.

Council of Science Editors:

Xu Y. Social-similarity-based Multicast Routing Algorithms in Impromptu Mobile Social Networks. [Masters Thesis]. Texas State University – San Marcos; 2014. Available from: https://digital.library.txstate.edu/handle/10877/5334

28. Guniganti, Ramesh Goud. A Comparison of RTMP and HTTP Protocols with respect to Packet Loss and Delay Variation based on QoE.

Degree: 2013, , School of Computing

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5394

► In recent year’s multimedia services like Video-on-Demand (VoD) and mobile video streaming, videos for e-learning, video conferencing are growing predominantly, and the user’s expectations… (more)

Subjects/Keywords: HTTP; Mean Opinion Score; Quality of Experience; RTMP; Subjective Assessment; Network Emulator.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Guniganti, R. G. (2013). A Comparison of RTMP and HTTP Protocols with respect to Packet Loss and Delay Variation based on QoE. (Thesis). , School of Computing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5394

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

Chicago Manual of Style (16^th Edition):

Guniganti, Ramesh Goud. “A Comparison of RTMP and HTTP Protocols with respect to Packet Loss and Delay Variation based on QoE.” 2013. Thesis, , School of Computing. Accessed January 26, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5394.

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

MLA Handbook (7^th Edition):

Guniganti, Ramesh Goud. “A Comparison of RTMP and HTTP Protocols with respect to Packet Loss and Delay Variation based on QoE.” 2013. Web. 26 Jan 2021.

Vancouver:

Guniganti RG. A Comparison of RTMP and HTTP Protocols with respect to Packet Loss and Delay Variation based on QoE. [Internet] [Thesis]. , School of Computing; 2013. [cited 2021 Jan 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5394.

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

Council of Science Editors:

Guniganti RG. A Comparison of RTMP and HTTP Protocols with respect to Packet Loss and Delay Variation based on QoE. [Thesis]. , School of Computing; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5394

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

University of Minnesota

29. Zhao, Hong. Detecting Inconsistency and Using Non-randomized Studies in Research Synthesis.

Degree: PhD, Biostatistics, 2016, University of Minnesota

URL: http://hdl.handle.net/11299/182239

► In scientific research, multiple studies on the same intervention occur for many reasons, such as using different study populations or designs. Research synthesis attempts to… (more)

▼ In scientific research, multiple studies on the same intervention occur for many reasons, such as using different study populations or designs. Research synthesis attempts to integrate different data on the same topic for the purpose of making generalizations, and provides us with a formal method to systematically combine all available evidence. In this thesis, we focus on the synthesis of evidence from multiple clinical trials using network meta-analysis, and the more challenging problem of combining information from randomized clinical trials and less rigorous observational studies. Network meta-analysis (NMA) is an extension of standard pairwise meta-analysis to permit combination of results on more than two treatments. This enables both direct and indirect comparisons of treatments, and addresses the comparative effectiveness or safety of the treatments based on all sources of data. Current NMA methods are usually based on a contrast-based (CB) model to estimate the relative treatment effects for each study. While popular and often effective, this model suffers from certain limitations. An alternative is the arm-based (AB) model, which estimates the mean response directly for each treatment. Compared to the CB framework, AB models are more straightforward to interpret, especially when implemented in a missing-data framework, by allowing use of a common baseline treatment across all trials. In a NMA, when direct and indirect evidence differ, the analysis is said to suffer from inconsistency, and the treatment effect estimates may be biased. Inconsistency detection methods using CB models have already been developed, but no corresponding method based on the newer AB models has yet been proposed. Here, we develop a Bayesian AB approach to detecting inconsistency. After detecting inconsistency, formal diagnostic tests should be performed to check whether this violation of assumption results in the change of treatment effects. Therefore, we next explore whether the trial-arm combinations that are sources of inconsistency are influential or outlying observations. To do this, we modify the "constraint case" method to produce diagnostics suitable for generalized linear models in NMA using either AB or CB models, where the outcome is binary. Lastly, we develop methods to combine the data from a randomized clinical trial and a propensity score-matched non-randomized study using commensurate priors. The approach determines the proper degree of borrowing from the non-randomized data by the similarity of the estimated treatment effects in the two studies. Performance of all our methods is evaluated via both example datasets and simulation studies. In summary, this dissertation work enables improved research synthesis in biomedical applications and sheds light on future research directions in the aforementioned areas.

Subjects/Keywords: Bayesian methods; Diagnostic tests; Inconsistency; Network meta-analysis; Propensity score; Randomized and Non-randomized Studies

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhao, H. (2016). Detecting Inconsistency and Using Non-randomized Studies in Research Synthesis. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/182239

Chicago Manual of Style (16^th Edition):

Zhao, Hong. “Detecting Inconsistency and Using Non-randomized Studies in Research Synthesis.” 2016. Doctoral Dissertation, University of Minnesota. Accessed January 26, 2021. http://hdl.handle.net/11299/182239.

MLA Handbook (7^th Edition):

Zhao, Hong. “Detecting Inconsistency and Using Non-randomized Studies in Research Synthesis.” 2016. Web. 26 Jan 2021.

Vancouver:

Zhao H. Detecting Inconsistency and Using Non-randomized Studies in Research Synthesis. [Internet] [Doctoral dissertation]. University of Minnesota; 2016. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/11299/182239.

Council of Science Editors:

Zhao H. Detecting Inconsistency and Using Non-randomized Studies in Research Synthesis. [Doctoral Dissertation]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/182239

University of Georgia

30. Crowell, Kevin Lee. Precipitation prediction using artificial neural networks.

Degree: 2014, University of Georgia

URL: http://hdl.handle.net/10724/25157

► Precipitation, in meteorology, is defined as any product, liquid or solid, of atmospheric water vapor that is accumulated onto the earth’s surface. Water, and thus… (more)

Subjects/Keywords: Artificial Neural Networks; Probabilistic Neural Network; Precipitation; Probability of Precipitation; Quantitative Precipitation; Brier Score

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Crowell, K. L. (2014). Precipitation prediction using artificial neural networks. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/25157

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

Chicago Manual of Style (16^th Edition):

Crowell, Kevin Lee. “Precipitation prediction using artificial neural networks.” 2014. Thesis, University of Georgia. Accessed January 26, 2021. http://hdl.handle.net/10724/25157.

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

MLA Handbook (7^th Edition):

Crowell, Kevin Lee. “Precipitation prediction using artificial neural networks.” 2014. Web. 26 Jan 2021.

Vancouver:

Crowell KL. Precipitation prediction using artificial neural networks. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Jan 26]. Available from: http://hdl.handle.net/10724/25157.

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

Council of Science Editors:

Crowell KL. Precipitation prediction using artificial neural networks. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/25157

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

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations