引導式測驗 · 中等 等級
基於圖形的推薦和 PinSage 測驗
測試圖形表示、PinSage 的歷史架構、鄰近採樣、評估限制以及何時關係資料可能有所幫助。
問題 1 的 8
How did the cited PinSage paper represent Pinterest’s data for its model?
預覽每個問題8 問題
當您參加測驗時,就會出現答案和解釋。
- How did the cited PinSage paper represent Pinterest’s data for its model?
- As a flat table with only item prices
- As a tree with every Pin assigned one permanent parent
- As a sequence with no item relationships
- As a graph with Pins and boards as node sets linked by board membership
- What information did PinSage combine when learning Pin embeddings?
- Only image pixels without graph relationships
- Graph-neighborhood context together with node features such as visual and annotation embeddings
- Only user demographics and price
- Only board names with no Pin features
- Why did PinSage use random-walk neighbor sampling?
- To remove all graph relationships from the representation
- To generate random product labels for training
- To build localized, bounded neighborhoods emphasizing frequently visited nodes
- To process every node’s full graph neighborhood exactly
- What does graph context help distinguish in Pinterest’s example?
- Items that look visually similar but occur in different board contexts
- Items with the same retail price but different colors
- Items with equal exposure time in every feed
- Items whose image files have different resolutions only
- What does PinSage demonstrate about graph recommenders?
- That every catalog should use Pins and boards as its graph
- That the 2018 results guarantee current production gains everywhere
- A scalable graph-convolution approach for learning item embeddings in one Pinterest setting
- That graph recommenders always outperform content models
- When could graph relationships add useful recommendation signal?
- When meaningful connections among items carry context that features alone may miss
- When item relationships are irrelevant to the task
- Whenever the model needs fewer data checks
- Only when every user has identical interests
- Which evaluation comparison is useful before adopting a graph recommender?
- Compare only the model’s embedding dimension
- Compare it with content and interaction baselines on the same task
- Compare training loss from unrelated datasets
- Skip held-out evaluation because graph structure explains recommendations
- What risk should be checked when building recommendation edges?
- Whether all nodes share the same image format
- Whether vector coordinates have human-readable labels
- Whether the recommendation is always the newest item
- Popularity or selection bias and whether graph edges are fresh