2018年04月_djph26741

转载 1、VGG16 2、VGG19 3、ResNet50 4、Inception V3 5、Xception介绍——迁移学习

ResNet, AlexNet, VGG, Inception: 理解各种各样的CNN架构本文翻译自ResNet, AlexNet, VGG, Inception: Understanding various architectures of Convolutional Networks，原作者保留版权卷积神经网络在视觉识别任务上的表现令人称奇。好的CNN网络是带有上百万参数和许...

2018-04-29 22:19:00 776

转载 Tensorflow深度学习之十二：基础图像处理之二

Tensorflow深度学习之十二：基础图像处理之二from：https://blog.csdn.net/davincil/article/details/76598474首先放出原始图像：1、图像的翻转import tensorflow as tfimport cv2# 这里定义一个tensorflow读取的图片格式转换为openc...

2018-04-26 17:02:00 145

转载 tensorflow实现图像的翻转

from:https://blog.csdn.net/uestc_c2_403/article/details/72703097tensorflow内部含有实现图像翻转的函数为tf.image.flip_up_down：从上向下翻转tf.image.flip_left_right：从左到又翻转tf.image.transpose_image：对角线翻转tf.image...

2018-04-26 16:59:00 234

转载 cnn handwrite使用原生的TensorFlow进行预测

100个汉字，放在data目录下。直接将下述文件和data存在同一个目录下运行即可。关键参数：run_mode = "train" 训练模型用，修改为validation 表示验证100张图片的预测精度，修改为inference表示预测 './data/00098/102544.png'这个图片手写识别结果，返回top3。charset_size = 100 表示汉字数目。如...

2018-04-26 15:34:00 152

转载 tflearn 中文汉字识别，训练后模型存为pb给TensorFlow使用——模型层次太深，或者太复杂训练时候都不会收敛...

tflearn 中文汉字识别，训练后模型存为pb给TensorFlow使用。数据目录在data，data下放了汉字识别图片：data$ ls0 1 10 11 12 13 14 15 16 2 3 4 5 6 7 8 9 datag$ ls 0xxx.png yyy.png ....代码：如果将get model里的模型层数加非常深，训练时候...

2018-04-25 11:25:00 185

转载 TensorFlow 图像预处理（一）图像编解码，图像尺寸调整

from: https://blog.csdn.net/chaipp0607/article/details/73029923TensorFlow提供了几类图像处理函数，下面介绍图像的编码与解码，图像尺寸调整。编码与解码图像解码与编码：一张RGB三通道的彩色图像可以看成一个三维矩阵，矩阵中的不位置上的数字代表图像的像素值。然后图像在存储时并不是直接记录这些矩阵中的数字，而...

2018-04-24 17:40:00 112

转载迁移学习算法之TrAdaBoost ——本质上是在用不同分布的训练数据，训练出一个分类器...

迁移学习算法之TrAdaBoost from： https://blog.csdn.net/Augster/article/details/53039489 TradaBoost算法由来已久，具体算法可以参考作者的原始文章，Boosting For Transfer Learning。1.问题定义传统的机器学习的模型都是建立在训练数据和...

2018-04-23 20:28:00 303

转载数据不够怎么训练深度学习模型？不妨试试迁移学习 ——重用神经网络的结构2...

数据不够怎么训练深度学习模型？不妨试试迁移学习本质就是这个图！pretrained model就是你截取的部分神经网络模型（迁移学习），而nanonet就是你自己加入的网络层。随着深度学习技术在机器翻译、策略游戏和自动驾驶等领域的广泛应用和流行，阻碍该技术进一步推广的一个普遍性难题也日渐凸显：训练模型所必须的海量数据难以获取。深度学习大牛吴恩达曾经说过：做...

2018-04-23 20:02:00 185

转载基于深度学习和迁移学习的识花实践——利用 VGG16 的深度网络结构中的五轮卷积网络层和池化层，对每张图片得到一个 4096 维的特征向量，然后我们直接用这个特征向量替代原来的图片，再加若干层全连接的...

基于深度学习和迁移学习的识花实践（转）深度学习是人工智能领域近年来最火热的话题之一，但是对于个人来说，以往想要玩转深度学习除了要具备高超的编程技巧，还需要有海量的数据和强劲的硬件。不过 TensorFlow 和 Keras 等框架的出现大大降低了编程的复杂度，而迁移学习的思想也允许我们利用现有的模型加上少量数据和训练时间，取得不俗的效果。这篇文章将示范如何利用迁移学...

2018-04-23 19:47:00 841

转载一文看懂迁移学习：怎样用预训练模型搞定深度学习？ ——重用神经网络的结构...

以上示例都是人类的迁移学习的能力。迁移学习是什么？所谓迁移学习，或者领域适应Domain Adaptation，一般就是要将从源领域（Source Domain）学习到的东西应用到目标领域（Target Domain）上去。源领域和目标领域之间往往有gap/domain discrepancy（源领域的数据和目标领域的数据遵循不同的分布）。迁移学习能够将适用于大数...

2018-04-23 19:36:00 493

转载迁移学习

转自：https://www.zhihu.com/question/41979241/answer/2474218891. 前言迁移学习（Transfer Learning,TL）对于人类来说，就是掌握举一反三的学习能力。比如我们学会骑自行车后，学骑摩托车就很简单了；在学会打羽毛球之后，再学打网球也就没那么难了。对于计算机而言，所谓迁移学习，就是能让现有的模型算法稍加调...

2018-04-23 16:04:00 248

转载 spark uniq 本质上就是单词计数

粗体部分示例： # dns_domain_info_list_rdd ==> [(src_ip, domain, domain_ip, timestamp, metadataid), ....] all_domains_list = dns_domain_info_list_rdd.map(lambda x: (x[1], 1)).reduceByKey(o...

2018-04-23 15:21:00 100

转载 DNS 负载均衡

转自：http://blog.csdn.net/cywosp/article/details/38017027 在上一篇文章（http://blog.csdn.net/cywosp/article/details/38014581）中讲到了使用HTTP重定向来实现服务器的负载均衡，本文则讲解另一种实现服务器集群的负载均衡方案——DNS域名解析。 DNS（Doma...

2018-04-20 14:53:00 72

转载 leetcode 83. Remove Duplicates from Sorted List

Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2...

2018-04-18 23:40:00 52

转载 leetcode 53. Maximum Subarray

Given an integer array nums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6...

2018-04-18 18:03:00 50

转载 leetcode 101. Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \...

2018-04-18 15:52:00 84

转载 leetcode 191. Number of 1 Bits

Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).For example, the 32-bit integer ’11' has binary representation 00000...

2018-04-17 23:22:00 74

转载胜利的欲望不会给你胜利

Lust for victory will not give you the victory. You must receive the victory from your opponent. He has no choice but to give it to you because he will sense your heart as better or truer. Nature...

2018-04-17 11:34:00 80

转载 leetcode 326. Power of Three

Given an integer, write a function to determine if it is a power of three. Follow up: Could you do it without using any loop / recursion?class Solution(object): def isPowerOfThr...

2018-04-17 00:31:00 89

转载 leetcode 231. Power of Two

Given an integer, write a function to determine if it is a power of two.class Solution(object): def isPowerOfTwo(self, n): """ :type n: int :rtype: bool ...

2018-04-16 22:45:00 103

转载 DGA域名——可以每天只生成一个域名，因此最多存在365个 DGA域名；

Mirai变种中的DGA分享到：发布时间：2016-12-12 16:02:57作者：360网络安全研究院投稿方式：发送邮件至linwei#360.cn，或登陆网页版在线投稿那个导致美国断网的Mirai 又出现带DGA变种，内置了域名生成算法。连续导致美国和德国断网事件的Mirai恶意软件，不仅感染并控制了越...

2018-04-16 16:25:00 532

转载 python 快速排序 qsort

def qsort(arr, start, end): if start > end: return def partition(arr, start, end): pivot = arr[start] i = start+1 while i <= end: ...

2018-04-16 10:38:00 249

转载 leetcode 27. Remove Element

Given an array nums and a value val, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the i...

2018-04-15 22:00:00 60

转载 leetcode 594. Longest Harmonious Subsequence

We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.Now, given an integer array, you need to find the length of its lo...

2018-04-15 19:55:00 68

转载 leetcode 405. Convert a Number to Hexadecimal

Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase.The hex...

2018-04-14 23:32:00 65

转载 leetcode 21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4O...

2018-04-14 22:33:00 53

转载 leetcode 70. Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a pos...

2018-04-14 13:09:00 72

转载 leetcode 257. Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]...

2018-04-14 12:58:00 132

转载 leetcode 720. Longest Word in Dictionary

Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possi...

2018-04-14 11:55:00 100

转载 Trie（前缀树/字典树）及其应用

from:https://www.cnblogs.com/justinh/p/7716421.htmlTrie，又经常叫前缀树，字典树等等。它有很多变种，如后缀树，Radix Tree/Trie，PATRICIA tree，以及bitwise版本的crit-bit tree。当然很多名字的意义其实有交叉。定义在计算机科学中，trie，又称前缀树或字典树，是一种有序树，...

2018-04-14 10:52:00 233

转载 DGA聚类使用DBScan

features = sc.parallelize(data_group[idx]).map(lambda x: (x.host_ip+'^'+x.domain, 1)).reduceByKey(operator.add).map(get_domain_features)def get_domain_features(x): host_url = x[0].split('...

2018-04-13 11:02:00 162

转载 leetcode 202. Happy Number

Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squa...

2018-04-11 23:10:00 87

转载 Unbuntu 终端中使用Tab键不能自动补全

解决方案1、利用vi编辑器打开 /etc/bash.bashrc文件（需要root权限）sudo vi /etc/bash.bashrc2、找到文件中的下列代码#enable bash completion in interactive shells#if ! shopt -oq posix; then# if [-f /usr/sh...

2018-04-11 10:40:00 141

转载 leetcode 671. Second Minimum Node In a Binary Tree

Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node...

2018-04-10 23:35:00 62

转载 python split space

发现自己写python的空格split还挺多坎的，尤其是最后一个是空格的情形：def split(s): i = 0 ans = [] while i < len(s): start = i # find space while i < len(s) and s[i] != ' ':...

2018-04-09 10:11:00 168

转载 leetcode 409. Longest Palindrome

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example "Aa" is not ...

2018-04-08 21:40:00 54

转载 leetcode 747. Largest Number At Least Twice of Others

In a given integer array nums, there is always exactly one largest element.Find whether the largest element in the array is at least twice as much as every other number in the array.If it is,...

2018-04-06 22:41:00 67

转载 leetcode 107. Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example:Given binary tree [3,9,20,nul...

2018-04-06 22:27:00 55

转载 leetcode 674. Longest Continuous Increasing Subsequence

Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).Example 1:Input: [1,3,5,4,7]Output: 3Explanation: The longest continuous...

2018-04-06 22:07:00 52

转载 leetcode 121. Best Time to Buy and Sell Stock

Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stoc...

2018-04-06 21:51:00 72

空空如也

空空如也