Papers with Code 아카이브
Data Summarization
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Data Summarization is a central problem in the area of machine learning, where we want to compute a small summary of the data.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
One-Shot Coresets: The Case of k-Clustering
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
Coresets for Vector Summarization with Applications to Network Graphs
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
Leveraging Sparsity for Efficient Submodular Data Summarization
Scalable k-Means Clustering via Lightweight Coresets
Graph Summarization Methods and Applications: A Survey
Less is More: Learning Prominent and Diverse Topics for Data Summarization
How to be Fair and Diverse?
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains
Sequential Quantiles via Hermite Series Density Estimation
Lazier Than Lazy Greedy
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.