Log in

Relevant bibliographies by topics / Weighted Clustering Algorithm / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Weighted Clustering Algorithm.

Dissertations / Theses on the topic 'Weighted Clustering Algorithm'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 16 dissertations / theses for your research on the topic 'Weighted Clustering Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Chan, Yat-ling, and 陳逸靈. "An optimization algorithm for clustering using weighted dissimilarity measures." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B26667009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zhou, Yufeng. "Performance Evaluation of a Weighted Clustering Algorithm in NSPS Scenarios." Thesis, KTH, Reglerteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-140427.

Full text

Abstract:

In national security and public safety (NSPS) scenarios, the concept of device-to-device (D2D) clustering allows user equipment (UEs) to dynamically form clusters and thereby allows for local communication with partial or no cellular network assistance. We propose and evaluate a clustering approach to solve this problem in this thesis report. One of the key components of clustering is the selection of so called cluster head (CH) nodes that are responsible for the formation of clusters and act as a synchronization and radio resource management information source. In this thesis work we propose

APA, Harvard, Vancouver, ISO, and other styles

3

Masum, Mohammad. "Vertex Weighted Spectral Clustering." Digital Commons @ East Tennessee State University, 2017. https://dc.etsu.edu/etd/3266.

Full text

Abstract:

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the v

APA, Harvard, Vancouver, ISO, and other styles

4

Fan, Yi. "Advancing Incomplete Algorithms for Maximum Weight Cliques." Thesis, Griffith University, 2017. http://hdl.handle.net/10072/371136.

Full text

Abstract:

Computing MaximumWeight Cliques (MWC) has many applications in data mining and computer vision including solving graphical models. Among various heuristic methods for MWC, local search is an e ective approach. The local search approach tries to improve the candidate clique by adding, dropping or swapping vertices. It is able to return good solutions in reasonable time periods. In this thesis, we use local search to solve the MWC problem on crafted instances, and then apply the algorithms to solve real-world problems. When we are solving real-world problems, we have to rst model them as an MWC

APA, Harvard, Vancouver, ISO, and other styles

5

Prego, Lilach. "Algorithm for directed graph clustering, based on edge weights and the implementation on web graphs /." [S.l.] : [s.n.], 2005. http://lib.haifa.ac.il/theses/general/001344252.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hunter, Brandon. "Channel Probing for an Indoor Wireless Communications Channel." BYU ScholarsArchive, 2003. https://scholarsarchive.byu.edu/etd/64.

Full text

Abstract:

The statistics of the amplitude, time and angle of arrival of multipaths in an indoor environment are all necessary components of multipath models used to simulate the performance of spatial diversity in receive antenna configurations. The model presented by Saleh and Valenzuela, was added to by Spencer et. al., and included all three of these parameters for a 7 GHz channel. A system was built to measure these multipath parameters at 2.4 GHz for multiple locations in an indoor environment. Another system was built to measure the angle of transmission for a 6 GHz channel. The addition of th

APA, Harvard, Vancouver, ISO, and other styles

7

Biswal, Suryadeep, and Dimol Soren. "Study of different mobility models and clustering algorithms like weighted clustering algorithm (WCA) and dynamic moblity adaptive clustering algorithm (DMAC)." Thesis, 2007. http://ethesis.nitrkl.ac.in/4211/1/Study_of_different_mobility_models_and_clustering_algorithms_like_Weighted_Clustering_Algorithm_(WCA)_and_Dynamic_Mobility_Adaptive_Clustering_Algorithm_(DMAC).pdf.

Full text

Abstract:

This project addresses issues pertaining to mobile multi-hop radio networks called mobile ad hoc networks (MANET), which plays a critical role in places where a wired backbone is neither available nor economical to deploy. Our objective was to form and maintain clusters for efficient routing, scalability and energy utilization. To map the cellular architecture into the mobile ad hoc network cluster heads are elected that form the virtual backbone for packet transmission. However, the constant movement of the nodes changes the topology of the network, which perturbs the transmission. This deman

APA, Harvard, Vancouver, ISO, and other styles

8

Pereira, Luís Miguel Azevedo. "TweeProfiles4: a weighted multidimensional stream clustering algorithm." Master's thesis, 2015. https://repositorio-aberto.up.pt/handle/10216/83533.

Full text

Abstract:

O aparecimento das redes sociais abriu aos utilizadores a possibilidade de facilmente partilharem as suas ideias a respeito de diferentes temas, o que constitui uma fonte de informação enriquecedora para diversos campos. As plataformas de microblogging sofreram um grande crescimento e de forma constante nos últimos anos. O Twitter é o site de microblogging mais popular, tornando-se uma fonte de dados interessante para extração de conhecimento. Um dos principais desafios na análise de dados provenientes de redes sociais é o seu fluxo, o que dificulta a aplicação de processos tradicionais de dat

APA, Harvard, Vancouver, ISO, and other styles

9

Pereira, Luís Miguel Azevedo. "TweeProfiles4: a weighted multidimensional stream clustering algorithm." Dissertação, 2015. https://repositorio-aberto.up.pt/handle/10216/83533.

Full text

Abstract:

O aparecimento das redes sociais abriu aos utilizadores a possibilidade de facilmente partilharem as suas ideias a respeito de diferentes temas, o que constitui uma fonte de informação enriquecedora para diversos campos. As plataformas de microblogging sofreram um grande crescimento e de forma constante nos últimos anos. O Twitter é o site de microblogging mais popular, tornando-se uma fonte de dados interessante para extração de conhecimento. Um dos principais desafios na análise de dados provenientes de redes sociais é o seu fluxo, o que dificulta a aplicação de processos tradicionais de dat

APA, Harvard, Vancouver, ISO, and other styles

10

Ye, Yanping, and 葉彥憑. "A Moving Pattern-Based Weighted Clustering Algorithm for VANETs." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/8p77cw.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>資訊管理系<br>100<br>Clustering of vehicles in a VANET can reduce the communication traffic information among vehicles. With an effective clustering algorithm, a cluster leader is responsible for detecting malicious nodes and broadcasting traffic information for the members of the same group. However, due to the high mobility of vehicles and the short linkage time between vehicles, forming stable clusters in a VANET remains a challenging problem. In this paper, we propose a Moving Pattern-based weighted Clustering Algorithm, termed MPCA, for VANETs. The MPCA algorithm consists of

APA, Harvard, Vancouver, ISO, and other styles

11

CHEN, CHANG-LIN, and 陳昌麟. "Improving the Performance of Hybrid Fuzzy Clustering Algorithm by Using Weighted Method in Parallel System." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/65rp69.

Full text

Abstract:

碩士<br>嶺東科技大學<br>資訊科技系碩士班<br>107<br>Due to the development of information technology, the amount of digital data in business applications is growing at a rapid rate and results in big-data analysis becomes an important issue. Big-data analysis offers various business benefits, including new revenue opportunities and more effective marketing strategy. However, most big data in business applications is presented in hybrid datasets which includes different types data i.e., numeric and text type data. Hybrid dataset leads to more efforts are used by big-data analyzers. This is because hybrid datase

APA, Harvard, Vancouver, ISO, and other styles

12

Dang, Sanjeena. "Variational Approximations and Other Topics in Mixture Models." Thesis, 2012. http://hdl.handle.net/10214/3876.

Full text

Abstract:

Mixture model-based clustering has become an increasingly popular data analysis technique since its introduction almost fifty years ago. Families of mixture models are said to arise when the component parameters, usually the component covariance matrices, are decomposed and a number of constraints are imposed. Within the family setting, it is necessary to choose the member of the family --- i.e., the appropriate covariance structure --- in addition to the number of mixture components. To date, the Bayesian information criterion (BIC) has proved most effective for this model selection process,

APA, Harvard, Vancouver, ISO, and other styles

13

Tian, Yi-Cheng, and 田益誠. "Cluster-Weighted Fuzzy Clustering Algorithms." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/66377500446890557129.

Full text

Abstract:

博士<br>中原大學<br>應用數學研究所<br>103<br>Fuzzy clustering is generally extended from hard clustering based on fuzzy membership partitions. In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the most well-known clustering method. Up to now, there are various generalizations of FCM. However, the FCM algorithm and its generalizations are always affected by initializations. In this paper, we consider a cluster-weighted term with an updating equation to adjust the effects of initializations to fuzzy clustering algorithms. We first propose the so-called cluster-weighted fuzzy clustering of the general

APA, Harvard, Vancouver, ISO, and other styles

14

Ma, Yen-Ting, and 馬嬿婷. "Sample and cluster weighted fuzzy c-means clustering algorithms." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/tpkev7.

Full text

Abstract:

碩士<br>中原大學<br>應用數學研究所<br>102<br>In fuzzy cluster analysis﹐the fuzzy c-means (FCM) clustering algorithm is the most well-known and used method. Up to now﹐there are various generalizations of FCM. In order to reduce the influences of the clustering results by outliers and noisy points﹐Yu, Yang and Lee (2011) proposed sample-weighted clustering methods that apply the maximum entropy principle to automatically calculate these sample weights so as to increase the robustness of the algorithm. The purpose of this thesis is to give a cluster-weighted version of sample-weighted FCM﹐called the sample an

APA, Harvard, Vancouver, ISO, and other styles

15

Tsai, Kai-Siang, and 蔡凱翔. "Using local link switching algorithm to control directed and weight network clustering coefficient." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/94797731947635120347.

Full text

Abstract:

碩士<br>淡江大學<br>資訊工程學系碩士班<br>98<br>Over the past decade the studies of complex networks have been analyzed and researched. In analyzing Clustering coefficient is a important concept Clustering coefficient characterizes the relative tightness of a network and is a defining network statistics that appears in many “real-world” network data. This paper proposed a local link switching algorithm which effectively increases the clustering coefficient of a directed weight network while preserving the network node degree distributions. This link switching algorithm is based on local neighborhood informat

APA, Harvard, Vancouver, ISO, and other styles

16

Liptak, Zsuzsanna. "Strings in Proteomics and Transcriptomics: Algorithmic and Combinatorial Questions in Mass Spectrometry and EST Clustering." Doctoral thesis, 2005. http://hdl.handle.net/11562/391087.

Full text

Abstract:

x<br>This thesis treats two problem areas in bioinformatics which can both be benefi- cially formalized as string problems. The first (and larger) part deals with weighted string problems as they arise from biotechnological mass spectrometry applications. In a mass spectrometry experiment—put in a simplified manner—the molecular mass of the sample mo- lecules is determined. The aim is to identify the sample, either with or without additional information from a database, relying on the fact that the different build- ing blocks of proteins (namely, amino acids) and of DNA molecules (nucleotides

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!