Search Results for "data mining algorithms in c#.net" - Page 3
Sort By:
Showing 193 open source projects for "data mining algorithms in c#.net"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion... -
2
http://www.filehelpers.net The FileHelpers are an easy to use .NET library written in C#. Is designed to read/write data from flat files with fixed length or delimited records (CSV). Also has support to import/export data from different data storages (Excel, Access, SqlServer) Code on GitHub: https://github.com/MarcosMeli/FileHelpers
-
3
GTkNN
GPU-based Textual kNN (GT-kNN)
The following code is a parallel kNN implementation that uses GPUs for the high dimensional data in text classification. You can use it to classify documents using kNN or to generate meta-features based on the distances between a query document and its k nearest neigbors -
4
libmng -THE reference library for reading, displaying, writing and examining Multiple-Image Network Graphics. MNG is the animation extension to the popular PNG image-format.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
Triepocalypse
A trie data structure extracted from the typing game Typocalypse.
The typing game Typocalypse (https://code.google.com/p/typocalypse/source/browse/#hg/Trie) used a trie data structure which has been linked to separately from the game and has been of separate interest for some years now. It has now been given its own repository. A trie is a data structure used to find strings from their prefixes. After having stored strings in the trie, the trie will efficiently find all the strings which start with a particular prefix. Project was developed using C... -
6
librfc
Public domain implementations of core RFC specifications for C/C++.
librfc is a C/C++ shared library containing public domain implementations of core RFC data structures and algorithms written in C++11. -
7
...), In Proceedings of 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2013), 2013. Minimal Quadtree Format for Compression of Sparse Matrices Storage (I. Šimeček, D. Langr, P. Tvrdik), In 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'2012), 2012.
-
8
Ginors Sort
sorting algorithm for binary keys
in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] } -
9
Mr.FSM
Large-Scale Frequent Subgraph Mining in MapReduce
This is the program used in the following paper: Wenqing Lin, Xiaokui Xiao, and Gabriel Ghinita. Large-Scale Frequent Subgraph Mining in MapReduce. In Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE), pages 844-855, 2014. Please cite the paper if you choose to use the program. If having any problems, please report to {wlin1 at ntu dot edu dot sg}. -
Turn Your Content into Interactive Magic - For FreeTransform anything you share into an engaging digital experience - for free. Instantly convert your PDFs, slides, and files into dynamic, interactive sessions with built-in collaboration tools, activities, and real-time assessment. From teaching to training to team building, make every presentation unforgettable. Used by millions for education, business, and professional development.
-
10
libdry
Public domain implementations of useful data structures for C++14.
libdry is a C++44 shared library containing public domain implementations of data structures and algorithms. -
11
libcutils
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference... -
12
Online Signature Verification
Real time signature verification using MATLAB and C#
Online Signature Verification technology requires primarily a digitizing tablet and a special pen connected to the USB port of a computer. An individual can sign on the digitizing tablet using the special pen regardless of his signature size and position. The signature is characterized as pen-strokes consisting x-y coordinates and pressure with the data being stored in a signature database. Dynamic time warping (DTW) and quadratic discriminant analysis (QDA) is used to get results where... -
13
DRAMMS
A Deformable Medical Image Registration Toolbox
DRAMMS is a software package designed for 2D-to-2D and 3D-to-3D deformable medical image registration tasks. Released by Section of Biomedical Image Analysis (SBIA) at the University of Pennsylvania. Some typical applications of DRAMMS include, -- Cross-subject registration of the same organ (can be brain, breast, cardiac, etc); -- Mono- and Multi-modality registration (MRI, CT, histology); -- Longitudinal registration (pediatric brain growth, cancer development, mouse... -
14
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of high... -
15
PdfPageCounter
C++ code to count the number pages in a given PDF file.
This C++ library contains the 'PdfPageCount' class that performs the single task of finding the number of pages in a given PDF document. While the PdfPageCount class is very simple to use, the contained code is complex because the page count can be hidden in any number of places, quite often within compressed data. -
16
MRA
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide... -
17
XanLib is a Linux library which provides data structures like hash tables, lists, pipes etc.. Each data structure exposes both synchronized and not synchronized methods.
-
18
Rating Algorithms
Library implementating various rating, scoring, ranking algorithms.
The rating algorithms library contains various algorithms used to accurately rank, score or rate collections of similar data. One example is the ranking of votes based on a 5 star scale. This project started as a need of ordering data based on the relevance of each record obtained from users. The first algorithm implemented is based on Wilson Score Interval. -
19
VandaMiaMightyCollection
Data container similar to Visual Basic Collection as a COM component
This is an COM/ATL implementation of data container similar to Visual Basic Collection that can perform any operation in logarithm time. -
20
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
21
Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e...
-
22
drvq
dimensionality-recursive vector quantization
drvq is a C++ library implementation of dimensionality-recursive vector quantization, a fast vector quantization method in high-dimensional Euclidean spaces under arbitrary data distributions. It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter... -
23
This library implements a thread-safe skip list data structure - a kind of list with good insertion, deletion and searching performances. It uses Fred Fish's dbug library as internal tracing/debugging system. See the web site for more details.
-
24
All About Data Structures
Sorting Searching List Template All
This will help a new data structure learner to learn data structures quickly. -
25
PPSeq: Parallel NGS Analysis
Parallel Processing for Next-Generation Sequencing (NGS) Analysis
High-throughput next generation sequencing (NGS) technology has quickly emerged as a powerful tool in many aspects of biomedical research. However, along with its rapid development, the data magnitude and analysis complexity for NGS far exceed the capacity and capability of traditional small-scale computing facilities, such as multithreading algorithms on standalone workstations. To address this issue, here we present a solution using the ever-increasing supply of processing power by massive...
