방법 비교

	준지도 Doc2Vec	Doc2Vec	레이블 전파
분야	딥러닝	텍스트 마이닝	머신러닝
계열	Machine learning	Process / pipeline	Machine learning
기원 연도	2014–2017	2014	2002
창시자	Le, Q. V. & Mikolov, T. (base Doc2Vec); semi-supervised extensions by various authors circa 2015–2019	Quoc V. Le & Tomas Mikolov	Zhu, X. & Ghahramani, Z.
유형	Semi-supervised representation learning	Document-embedding representation learning	Graph-based semi-supervised classification
원전	Le, Q. V., & Mikolov, T. (2014). Distributed Representations of Sentences and Documents. Proceedings of the 31st International Conference on Machine Learning (ICML 2014), PMLR 32(2), 1188–1196.	Le, Q. V. & Mikolov, T. (2014). Distributed Representations of Sentences and Documents. Proceedings of the 31st International Conference on Machine Learning (ICML), 1188-1196.	Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University.
별칭	Semi-supervised Paragraph Vector, SS-Doc2Vec, Label-guided PV-DBOW, Semi-supervised PV-DM	paragraph vector, document embeddings, Doc2Vec Belge Gömülmeleri	LP, label spreading, graph-based semi-supervised learning, harmonic label propagation
관련	3	4	3
요약	Semi-supervised Doc2Vec extends the Paragraph Vector framework of Le and Mikolov (2014) by training dense document embeddings on both labeled and unlabeled corpora simultaneously, using available class labels as an auxiliary signal to steer the representation toward task-relevant structure while still exploiting the full unlabeled collection for generalization.	Doc2Vec, also known as Paragraph Vector, is a representation-learning method introduced by Le and Mikolov (2014) that maps whole documents to fixed-length dense vectors. These vectors place similar documents close together in space, supporting document comparison and classification.	Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.