Leetcode 239 Sliding Window Maximum

OK。终于仍不住要自己开贴记录一下刷题流程了。那么就从今天开始吧,希望今年能把所有的内容都更新起来。 https://leetcode.com/problems/sliding-window-maximum/ 做到这题是因为这是 Cloudera 的OA的一题。 先上

Network Centrality

This is one of notes from CS3943/9223 Foundation of Data Science at New York University. In this article, we talk about how to measure the centrality in networks. What is centrality? In graph theory and network analysis, indicators of centrality identify the most important vertices within a graph. Here is an example network with 5 nodes, and 5 links. There are three ways to measure centrality: 1. Degree centrality 2.

Preicision, Recall, and F-Measure

This is one of notes from CS3943/9223 Foundation of Data Science at New York University. First of all, we have definitions: In pattern recognition and information retrieval with binary classification, precision (also called positive predictive value) is the fraction of retrieved instances that are relevant, while recall (also known as sensitivity) is the fraction of relevant instances that are retrieved. Both precision and recall are therefore based on an understanding and measure of relevance.