Unverified50% confidenceFactExact time
XGBoost's histogram algorithm discretizes continuous features into a fixed number of bins (typically 256), reducing the split-point search complexity from O(n·d) to O(bins).
1
Sources
50%
Confidence
Long-term
Relevance
9/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedXGBoost introduced regularization terms, column subsampling, and efficient split-point search algorithms such as histogram acceleration.78% similarVerifiedThe Hungarian algorithm has a time complexity of O(n³) and can find the globally optimal assignment in bipartite graph matching problems.67% similarUnverifiedselect 受限于 FD_SETSIZE（通常为1024），poll 采用线性扫描为 O(n) 复杂度66% similarUnverified倒排乘积量化（IVFPQ）在PQ基础上引入倒排索引结构，通过聚类将向量库分区，将检索复杂度从线性降低至亚线性64% similarUnverifiedThe HNSW algorithm achieves hierarchical search by constructing a multi-layer graph structure, approximately reducing the exponential complexity of exact nearest-neighbor search to logarithmic complexity, making it the most mainstream index structure in current vector databases.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/850178API
curl https://kongchang.com/api/v1/knowledge/claims/850178MCP
get_claim(id=850178)