2010
- betaは共通である仮定
- 二乗誤差を最適化する手法による拡張
batchによる変分ベイズ法のアルゴリズムは一定のメモリー空間を必要とし,CGBより高速であることがわかっている.
{ | |
"hoge": "foo" | |
} |
private static class MessageDataSerializer extends JsonDeserializer<MessageData> { | |
@Override | |
public MessageData deserialize(final JsonParser p, | |
final DeserializationContext ctxt) | |
throws ValidationException { | |
try { | |
final var treeNodeText = ((TextNode) p.getCodec().readTree(p)).asText(); | |
final var decoded = decodeBase64Data(treeNodeText); | |
return OBJECT_MAPPER.readValue(decoded, MessageData.class); |
import java.net.URI; | |
import java.util.Map; | |
import java.util.stream.Collectors; | |
import java.util.stream.Stream; | |
import lombok.AccessLevel; | |
import lombok.Builder; | |
import lombok.RequiredArgsConstructor; | |
import lombok.ToString; | |
import org.springframework.lang.NonNull; | |
import org.springframework.web.util.UriComponentsBuilder; |
from collections import Counter | |
from itertools import chain, combinations | |
from tqdm import tqdm | |
class BitermConverter: | |
def __init__(self, include_docs=False, min_df=1): | |
self.biterms = Counter() | |
self.include_docs = include_docs | |
self.min_df = min_df |
import numpy as np | |
import scipy.linalg.blas as slb | |
import time | |
M = 10000 | |
N = 6000 | |
k_list = [64, 128, 256, 512, 1024, 2048, 4096, 8192] | |
np.show_config() |
''' | |
requirement : janome, pandas | |
''' | |
import re | |
from janome.tokenizer import Tokenizer | |
import unicodedata | |
from html import unescape | |
import pandas as pd |