kkweon

#!/usr/bin/env swipl

:- use_module(library(dcg/basics)).
:- use_module(library(main)).
:- initialization(main, main).

expression(Value) --> term(V1), whites, expression_tail([V1], Value).

expression_tail(Stack, Value) -->
  term(NewValue), { NewStack = [NewValue|Stack] }, whites, expression_tail(NewStack, Value).

kkweon

https://www.youtube.com https://www.youtube.com/premium

https://music.youtube.com https://music.youtube.com/premium

Inline link vnd.youtube.music://music.youtube.com/musicpremium

kkweon

[
  {
    "var_name": "SEX",
    "name": "응답자 성별",
    "description": "같이 살고 있는 가족과 따로 살고 있는 가족, 가족은 아니지만 현재 귀댁에서 같이 살고 있는 사람 모두를"
  },
  {
    "var_name": "AGE",
    "name": "응답자 연령",
    "description": "같이 살고 있는 가족과 따로 살고 있는 가족, 가족은 아니지만 현재 귀댁에서 같이 살고 있는 사람 모두를"

kkweon

• Decision Tree가 Greedy Algorithm인 이유
  • 가 주어졌을때 Speed를 예측하는 Decision Tree를 만든다고 가정한다.
  • Base Entropy
  • Grade is Steep
  • Grade is Flat

Decision Tree가 Greedy Algorithm인 이유

Grade	Bumpiness	Speed limit	Speed

kkweon

Directory Structure

tree

.
├── image1

kkweon

Implement get-in

https://clojuredocs.org/clojure.core/get-in

from typing import List, Optional


def get_in(data: dict, keywords: List[any]) -> Optional[any]:
    """Implementation of `get-in` in clojure

kkweon

map F createActiveTabbedHint
let blacklists = ["https://docs.google.com/*","https://codepen.io/*"]

kkweon

Naver Movie

import requests
import bs4
from pprint import pprint
url = "http://movie.naver.com/movie/bi/mi/pointWriteFormList.nhn?code=140695&type=after&isActualPointWriteExecute=false&isMileageSubscriptionAlready=false&isMileageSubscriptionReject=false"


def find_div(bs, class_name):

kkweon

kkweon

Jupyter Notebook Viewer

Nbviewer?

• Vieweing ipynb files on Nbviewer is so much faster than on the Github.

No more waiting

Get started