代码搜索：Classify
找到约 2,639 项符合「Classify」的源代码
代码结果 2,639
www.eeworm.com/read/168845/5433607
ipp boost_no_ctype_functions.ipp
// (C) Copyright John Maddock 2001.
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http
www.eeworm.com/read/413912/11137543
pred dataexample2.txt.pred
Processing Filename: demo\DataExample2.txt
Classifier:GMM_classify -Kernel 0 -CostFactor 3
Message: Train-Test Split, Boundary: -2, Classification, Shuffled
www.eeworm.com/read/413912/11137573
m sample2.m
global preprocess;
preprocess.Vebosity = 1;
preprocess.Message = '';
%preprocess.SizeFactor = 0.5;
%Shuffle the data set
preprocess.Shuffled = 0;
%Normalize the data
preprocess.Normalizati
www.eeworm.com/read/247646/12638190
makefile
CC = gcc
CFLAGS = -O2
#CFLAGS = -g -Wall
##############################
all: Ltree Ltree_u
Ltree: Ltree.o BuildTree.o discrim.o classify.o distributions.o Combine.o entropia.o prune.o Ci_instances.o
www.eeworm.com/read/112466/15484819
c class.c
/****************************************************************************
File Name : class.c
Purpose : provides algorithm for contour detection and classification
Release : Version 1
www.eeworm.com/read/179898/9331889
in insect.in
#!@PERL@
#---------------------------------------------------------------------------
#@COPYRIGHT :
# Copyright 1998, Alex P. Zijdenbos
# McConnell Brain Imaging Centre,
#
www.eeworm.com/read/166836/9995417
m cl_fruits.m
% CL_fruits.m
% Classify 4 different fruits into 4 bins
% using a NN.
% PenChen Chou, July, 17, 2001
% I/O Patterns
In_pattern=[1 -1 -1;1 1 -1;-1 1 -1;1 -1 1]';
Target=[-1 -1;-1 1;1 -1;1 1
www.eeworm.com/read/164583/10100686
am makefile.am
# filename : /zpr/bspk/src/hmm/ghmm/ghmm/Makefile.am
# created : DATE: April 2001
# $Id: Makefile.am,v 1.29 2003/12/19 17:58:52 schliep Exp $
#
# Copyright (C) 1998-2001, ZAIK/ZPR, Univers
www.eeworm.com/read/416681/11017994
cpp 3.9.cpp
#include
void print_matrix(int n)
{
int a[101][101];
int i,j,k;
k=1;
for(i=1;i