摘要: 顺序栈:import java.util.Arrays;public class SequenceStack { private int DEFAULT_SIZE = 10; private int capacity; private int capacityIncrement =... 阅读全文
posted @ 2014-04-15 11:20 Bleachzk 阅读(123) 评论(0) 推荐(0) 编辑
摘要: public class DuLinkList { private class Node{ private T data; private Node prev; private Node next; @SuppressWarnings("... 阅读全文
posted @ 2014-04-15 09:54 Bleachzk 阅读(124) 评论(0) 推荐(0) 编辑
摘要: package LinkList;public class LinkList { private class Node{ private T data; private Node next; @SuppressWarnings("unused") ... 阅读全文
posted @ 2014-04-13 18:30 Bleachzk 阅读(164) 评论(0) 推荐(0) 编辑
摘要: package SequenceList;import java.util.Arrays;public class SequenceList { private int DEFAULT_SIZE = 16; //保存数组的长度 private int capacity; //... 阅读全文
posted @ 2014-04-13 18:27 Bleachzk 阅读(336) 评论(0) 推荐(0) 编辑
摘要: /* Porter stemmer in Java. The original paper is in Porter, 1980, An algorithm for suffix stripping, Program, Vol. 14, no. 3, pp 130-137, See also http://www.tartarus.org/~martin/PorterStemmer History: Release 1 Bug 1 (reported by Gonzalo Parra 16/10/99) fixed as marked below. ... 阅读全文
posted @ 2014-04-12 21:08 Bleachzk 阅读(368) 评论(0) 推荐(0) 编辑
摘要: 算法描述:算法说明:该算法是概念空间挖掘最简单的算法,只考虑了正实例,不断做泛化,实际上求得了一个最特化边界算法实现:import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;public class FindS { /** * @param args * @throws IOException */ public static void main(String[] args) throws IOException { int maxT... 阅读全文
posted @ 2014-04-06 00:05 Bleachzk 阅读(396) 评论(0) 推荐(0) 编辑
摘要: 算法描述:Initialize G to the set of most-general hypotheses in H Initialize S to the set of most-specific hypotheses in H For each training example, d, do: If dis a positive example then: Remove from G any hypotheses that do not match d For each hypothesis sin S that does not match d Remove s from... 阅读全文
posted @ 2014-04-05 23:54 Bleachzk 阅读(728) 评论(0) 推荐(0) 编辑