Gotowe bibliografie tematyczne / Two party clustering

Spis treści

Artykuły w czasopismach

Gotowa bibliografia na temat „Two party clustering”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Two party clustering”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Two party clustering"

Kumari, Priya, and Seema Maitrey. "Two Party Hierarichal Clustering Over Horizontally Partitioned Data Set." International Journal of Data Mining & Knowledge Management Process 7, no. 3 (2017): 33–43. http://dx.doi.org/10.5121/ijdkp.2017.7303.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Tripathy, Animesh, and Ipsa De. "Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset." Journal of Software Engineering and Applications 06, no. 05 (2013): 26–31. http://dx.doi.org/10.4236/jsea.2013.65b006.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Bunn, Paul, and Rafail Ostrovsky. "Oblivious Sampling with Applications to Two-Party k-Means Clustering." Journal of Cryptology 33, no. 3 (2020): 1362–403. http://dx.doi.org/10.1007/s00145-020-09349-w.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Feldman, Nizan, and Tal Sadeh. "War and Third-party Trade." Journal of Conflict Resolution 62, no. 1 (2016): 119–42. http://dx.doi.org/10.1177/0022002716644329.

Pełny tekst źródła

Streszczenie:

Few studies explain how wars affect trade with third parties. We argue that wartime trade policies should raise trade with friendly and enemy-hostile third parties but reduce trade with hostile and enemy-friendly third parties. At the same time, the private motivation of firms and households may be incompatible with national wartime trade policies and constrain the effectiveness of wartime trade policies. Our directed dyadic data set consists of almost all of the states from 1885 to 2000. Running a high definition fixed effects regression with two-way clustering of standard errors, we find that hostile third parties tended to reduce trade with a combatant state by roughly 30 percent. In addition, trade with third parties friendly to the enemy fell by a similar magnitude. In contrast, on average, war hardly affected trade with third parties because of substitution of war-ridden markets with third-party business partners.

Style APA, Harvard, Vancouver, ISO itp.

Jiang, Zoe L., Ning Guo, Yabin Jin, et al. "Efficient two-party privacy-preserving collaborative k-means clustering protocol supporting both storage and computation outsourcing." Information Sciences 518 (May 2020): 168–80. http://dx.doi.org/10.1016/j.ins.2019.12.051.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Lee, Hyun-Chool, and Alexandre Repkine. "Do Political Parties Represent Voters’ Preference? A Clustering Analysis of Korea’s Local Election of 2018." Philippine Political Science Journal 44, no. 2 (2023): 121–51. http://dx.doi.org/10.1163/2165025x-bja10045.

Pełny tekst źródła

Streszczenie:

Abstract We employ the results of a survey conducted on two thousand voters that have participated in Korean local election of 2018 to perform clustering analysis of Korean voters’ preferences. We attempt to test the hypothesis of these preferences being adequately represented by the five major political parties. We find that there was likely a significant mismatch between Korean voters and the five voting camps identified under the assumption of five being an optimal number of the voting clusters. After relaxing this assumption we found that the optimal number of voting camps in Korea is two or three, suggesting that a two or a tri-partite political party system would have been a more adequate match representing Korean voters’ preferences in 2018.

Style APA, Harvard, Vancouver, ISO itp.

Ping, Yuan, Bin Hao, Xiali Hei, Jie Wu, and Baocang Wang. "Maximized Privacy-Preserving Outsourcing on Support Vector Clustering." Electronics 9, no. 1 (2020): 178. http://dx.doi.org/10.3390/electronics9010178.

Pełny tekst źródła

Streszczenie:

Despite its remarkable capability in handling arbitrary cluster shapes, support vector clustering (SVC) suffers from pricey storage of kernel matrix and costly computations. Outsourcing data or function on demand is intuitively expected, yet it raises a great violation of privacy. We propose maximized privacy-preserving outsourcing on SVC (MPPSVC), which, to the best of our knowledge, is the first all-phase outsourceable solution. For privacy-preserving, we exploit the properties of homomorphic encryption and secure two-party computation. To break through the operation limitation, we propose a reformative SVC with elementary operations (RSVC-EO, the core of MPPSVC), in which a series of designs make selective outsourcing phase possible. In the training phase, we develop a dual coordinate descent solver, which avoids interactions before getting the encrypted coefficient vector. In the labeling phase, we design a fresh convex decomposition cluster labeling, by which no iteration is required by convex decomposition and no sampling checks exist in connectivity analysis. Afterward, we customize secure protocols to match these operations for essential interactions in the encrypted domain. Considering the privacy-preserving property and efficiency in a semi-honest environment, we proved MPPSVC’s robustness against adversarial attacks. Our experimental results confirm that MPPSVC achieves comparable accuracies to RSVC-EO, which outperforms the state-of-the-art variants of SVC.

Style APA, Harvard, Vancouver, ISO itp.

A, Pranav Shriram, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, and Bhavish Raj Gopal. "Find Thy Neighbourhood: Privacy-Preserving Local Clustering." Proceedings on Privacy Enhancing Technologies 2023, no. 2 (2023): 23–39. http://dx.doi.org/10.56553/popets-2023-0039.

Pełny tekst źródła

Streszczenie:

Identifying a cluster around a seed node in a graph, termed local clustering, finds use in several applications, including fraud detection, targeted advertising, community detection, etc. However, performing local clustering is challenging when the graph is distributed among multiple data owners, which is further aggravated by the privacy concerns that arise in disclosing their view of the graph. This necessitates designing solutions for privacy-preserving local clustering and is addressed for the first time in the literature. We propose using the technique of secure multiparty computation (MPC) to achieve the same. Our local clustering algorithm is based on the heat kernel PageRank (HKPR) metric, which produces the best-known cluster quality. En route to our final solution, we have two important steps: (i) designing data-oblivious equivalent of the state-of-the-art algorithms for computing local clustering and HKPR values, and (ii) compiling the data-oblivious algorithms into its secure realisation via an MPC framework that supports operations over fixed-point arithmetic representation such as multiplication and division. Keeping efficiency in mind for large graphs, we choose the best-known honest-majority 3-party framework of SWIFT (Koti et al., USENIX'21) and enhance it with some of the necessary yet missing primitives, before using it for our purpose. We benchmark the performance of our secure protocols, and the reported run time showcases the practicality of the same. Further, we perform extensive experiments to evaluate the accuracy loss of our protocols. Compared to their cleartext counterparts, we observe that the results are comparable and thus showcase the practicality of the designed protocols.

Style APA, Harvard, Vancouver, ISO itp.

Oswald, Michael T., Meike Fromm, and Elena Broda. "Strategic clustering in right-wing-populism? ‘Green policies’ in Germany and France." Zeitschrift für Vergleichende Politikwissenschaft 15, no. 2 (2021): 185–205. http://dx.doi.org/10.1007/s12286-021-00485-6.

Pełny tekst źródła

Streszczenie:

AbstractPast research pointed to the idea that right-wing ideology and climate-change skepticism are inherently linked. Empirical reality proves differently however, since right-wing populist parties are starting to adapt pro environmentalist stances. In this paper, we look into two prominent cases of diametrical diverging environmental strategies by right-wing-populist-parties: France’s Rassemblement National and Germany’s Alternative für Deutschland. In order convey this point, we use comparative qualitative content analysis and examine several decisive determinants regarding environmental strategies of right-wing populist parties. We argue that right-wing-populism is remarkably adaptable considering political opportunity structures, even clustering in ideologically diametrical versions of the same issue while each party coherently extends its policy-orientation to its respective alignment of the issue. That means, populism might be far less ideological than assumed in the past.

Style APA, Harvard, Vancouver, ISO itp.

Anglou, Fiorentia Zoi, Stavros Ponis, and Athanasios Spanos. "A machine learning approach to enable bulk orders of critical spare-parts in the shipping industry." Journal of Industrial Engineering and Management 14, no. 3 (2021): 604. http://dx.doi.org/10.3926/jiem.3446.

Pełny tekst źródła

Streszczenie:

Purpose: The main purpose of this paper is to propose a methodological approach and a decision support tool, based on prescriptive analytics, to enable bulk ordering of spare parts for shipping companies operating fleets of vessels. The developed tool utilises machine learning and operations research algorithms, to forecast and optimize bulk spare parts orders needed to cover planned maintenance requirements on an annual basis and optimize the company’s purchasing decisions.Design/methodology/approach: The proposed approach consists of three discrete methodological steps, each one supported by a decision support tool based on clustering and machine learning algorithms. In the first step, clustering is applied in order to identify high interest items. Next, a forecasting tool is developed for estimating the expected needs of the fleet and to test whether the needed quantity is influenced by the source of purchase. Finally, the selected items are cost-effectively allocated to a group of vendors. The performance of the tool is assessed by running a simulation of a bulk order process on a mixed fleet totaling 75 vessels.Findings: The overall findings and approach are quite promising Indicatively, shifting demand planning focus to critical spares, via clustering, can reduce administrative workload. Furthermore, the proposed forecasting approach results in a Mean Absolute Percentage Error of 10% for specific components, with a potential for further reduction, as data availability increases. Finally, the cost optimizer can prescribe spare part acquisition scenarios that yield a 9% overall cost reduction over the span of two years.Originality/value: By adopting the proposed approach, shipping companies have the potential to produce meaningful results ranging from soft benefits, such as the rationalization of the workload of the purchasing department and its third party collaborators to hard, quantitative benefits, such as reducing the cost of the bulk ordering process, directly affecting a company’s bottom line.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!