Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - Tree
Search - Tree - List
分类知识的获取是数据挖掘要实现的重要任务之一,其核心问题是解决分类模型的构造和分类算法实现。本文以决策树分类方法中有代表性的方法C4.5为例,介绍数据挖掘中一种分类方法一决策树分类方法及其构建和应用研究。-Classification of knowledge acquisition is a data mining in order to achieve one of the important tasks, the core of the problem is classification model to solve the structure and classification algorithm. In this paper, decision tree classification method C4.5 has representation as an example, the introduction of data mining in a classification of one decision tree classification method and its building and applied research.
Date : 2025-12-19 Size : 173kb User : 梁旭

Abtract - We propose a new family of fi lter banks, named NDFB, that can achieve the directional decomposition of arbitrary N-dimensional (N ≥ 2) signals with a simple and effi cient tree-structured construction.-Abtract- We propose a new family of fi lter banks, named NDFB, that can achieve the directional decomposition of arbitrary N-dimensional (N ≥ 2) signals with a simple and effi cient tree-structured construction.
Date : 2025-12-19 Size : 2.3mb User : Tin Ho

基于油罐火灾爆炸的故障详细的树形图分析文件-Oil tank fire and explosion on detailed fault tree analysis
Date : 2025-12-19 Size : 414kb User : tomjimi

data mining decision tr-data mining decision tree
Date : 2025-12-19 Size : 289kb User : George

edge set coding of spaning tr-edge set coding of spaning tree
Date : 2025-12-19 Size : 138kb User : khatere

SIGNAL RECONSTRUCTIONS FROM LIMITED MEASUREMENTS USING SPARSE-TREE PRIORS
Date : 2025-12-19 Size : 2.52mb User : xcc

方便的tree生成工具,方便的tree生成工具-A convenient tree generation tool
Date : 2025-12-19 Size : 2.99mb User : tom

:提出一种基于尺度不变特征变换(SIFT)特征匹配的目标跟踪方法.首先使用SIFT提取目标特征,构 建目标特征库,然后使用基于K维树的特征匹配算法,对实时序列图像提取的SIFT特征与特征库中目标进行精确匹配 -: Based on Scale Invariant Feature Transform (SIFT) feature matching target tracking. The first to use SIFT target feature extraction, feature library building goals, and then use the K-dimensional tree based feature matching algorithm for real-time image sequences extracted SIFT features and characteristics of the target database accurately match
Date : 2025-12-19 Size : 258kb User : LIDAN

This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF). - This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data performed to derive the lower and upper bounds of the confidence interval for the mean hop count between the source node of the data request, on one hand, and the node that holds the desired data and the last node in the set of search nodes, on the other hand. In the experimental evaluation, the performance of MDPF was compared to that of Random Packet Forwarding (RPF) and Minimal Spanning Tree Forwarding (MSTF).
Date : 2025-12-19 Size : 65kb User : sathiyaraj124

clustering algorithm
Date : 2025-12-19 Size : 468kb User : zxcv

Sensor routing techniques
Date : 2025-12-19 Size : 143kb User : rpteacher

FID3 Fuzzy Induction Decision Tr-FID3 Fuzzy Induction Decision Tree
Date : 2025-12-19 Size : 486kb User : Artz

vp-tree动态索引对于给定成对的距离搜索 搜索相邻…… 该文章为国外文献 以供各位参考-Dynamic vp-tree indexing for n-nearest neighbor search for foreign literature for the reference to the given pairs from the article
Date : 2025-12-19 Size : 200kb User : 小龙

一个对高维数据的索引结构 此为研究树形结构的国外文献 以供各位参考-One for reference for the study of foreign literature of the tree structure of the index structure of high dimensional data
Date : 2025-12-19 Size : 96kb User : 小龙

介绍与决策树相关的内容及剪枝方法的改进。-Improvement of the introduced content related to the decision tree pruning method.
Date : 2025-12-19 Size : 2.35mb User : fc

Implementation of Collection Tree Protocol in QualNet
Date : 2025-12-19 Size : 322kb User : Adil

Java tree tutorial for study
Date : 2025-12-19 Size : 234kb User : Vinicius

A Binary Tree for Probability Learning in Eye Detection
Date : 2025-12-19 Size : 393kb User : roko rabbolini

基于最小生成树的无线传感器网络路由算法研究,做该方面研究的可以下载使用。-Based on wireless sensor network routing algorithm minimum spanning tree, do the aspect of the study can be downloaded using the
Date : 2025-12-19 Size : 750kb User : 谢哲

The given rar code file provides different function to make a decision tree, Gives probabilty about the happening of an event.
Date : 2025-12-19 Size : 2kb User : Alishba
« 12 3 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.