विधियों की तुलना करें

	बोर्दा गणना एकत्रीकरण	स्टैक्ड जनरलाइज़ेशन	भारित मतदान
क्षेत्र	एन्सेम्बल अधिगम	एन्सेम्बल अधिगम	निर्णयन
परिवार	Machine learning	Machine learning	MCDM
उद्भव वर्ष	1781	1992	1951
प्रवर्तक	Jean-Charles de Borda	David Wolpert	Arrow, K. J.
प्रकार	rank-based aggregation	meta-learning aggregation	Social choice — weighted positional voting rule
मौलिक स्रोत	Borda, J. C. de (1781). Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences.	Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5(2), 241-259.	Arrow, K. J. (1951). Social Choice and Individual Values. Wiley, New York
उपनाम	weighted voting, rank aggregation	stacking, meta-learning	—
संबंधित	3	3	0
सारांश	Borda count is a preference aggregation method that combines ranked predictions from multiple classifiers by assigning points based on ranking position. Each classifier ranks the possible outcomes, and each class receives points inversely proportional to its rank position. The class with the highest total score is selected. Originally proposed by French mathematician Jean-Charles de Borda in 1781, this method has been adapted for ensemble learning to aggregate soft predictions and rank-ordered outputs.	Stacked generalization, or stacking, is a two-level ensemble method where base-level classifiers are trained on the original data, and a meta-learner is trained on the predictions of the base classifiers. The meta-learner learns how to best combine base predictions rather than using fixed aggregation rules. Introduced by David Wolpert in 1992, stacking achieves state-of-the-art performance by automatically learning the optimal weighting and interaction patterns among base models.	WEIGHTED-VOTING (Weighted Voting — Weighted positional aggregation of multiple rankings) is a ranking multi-criteria decision-making (MCDM) method introduced by Arrow, K. J. in 1951. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.