Search Results for "k-meleon"
Sort By:
Showing 16 open source projects for "k-meleon"
View related business solutions-
Transforming NetOps Through No-Code Network Automation - NetBrainNetBrain, founded in 2004, provides a powerful no-code automation platform for hybrid network observability, allowing organizations to enhance their operational efficiency through automated workflows. The platform applies automation across three key workflows: troubleshooting, change management, and assessment.
-
Striven | All In One Business Management SoftwareStriven is the all-in-one business management software that lowers your costs, improves your operations, and makes work easier. Make your company’s data coherent, connected, and relevant.
-
1
Oryx
Lambda architecture on Apache Spark, Apache Kafka for real-time
Oryx 2 is a realization of the lambda architecture built on Apache Spark and Apache Kafka, but with specialization for real-time large-scale machine learning. It is a framework for building applications but also includes packaged, end-to-end applications for collaborative filtering, classification, regression and clustering. The application is written in Java, using Apache Spark, Hadoop, Tomcat, Kafka, Zookeeper and more. Configuration uses a single Typesafe Config config file, wherein... -
2
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
3
This application allow user to predict dissolution profile of solid dispersion systems based on algorithms like symbolic regression, deep neural networks, random forests or generalized boosted models. Those techniques can be combined to create expert system. Application was created as a part of project K/DSC/004290 subsidy for young researchers from Polish Ministry of Higher Education.
-
4
cbrTekStraktor
an application to automatically extract text from comic books.
...The text extraction is achieved by a combination of statistical and graphical processing operations. It is based on the following 3 major algorithms - Binarization of color images (Niblak and other methods) - Connected components - K-Means clustering Apache Tesseract is used to perform Optical Character Recognition on the extracted text. A subsequent version of the application will integrate with translation software in order to provide automated translation of comic book texts and re-inserion of translated texts -
ServiceDesk Plus, a world-class IT and enterprise service management platformBest in class online service desk software. Offer your customers world-class services with ServiceDesk Plus Cloud, the easy-to-use SaaS service desk software from ManageEngine, the IT management division of Zoho. Track and manage IT tickets efficiently, resolve issues faster, and ensure end-user satisfaction with the cloud-based IT ticketing system used by over 100,000 IT service desks worldwide. Manage the complete life cycle of IT incidents, problems, changes, and projects with out of the box ITIL workflows. Create support SLAs, define escalation levels, and ensure compliance. Automate ticket dispatch, categorization, classification, and assignment based on predefined business rules, and set up notifications and alerts for timely ticket resolution. Reduce walk ins and unnecessary tickets by giving your users more control. Enable end users to access IT services through your service catalog in the self-service portal. Help users create and track tickets and search for solutions.
-
5
Belief Reviser
Belief Revision via PS-Merge under constraints belief merging operator
Belief revision is a central topic in knowledge representation and reasoning. It consists in incorporating a new belief, changing as few as possible of the original beliefs while preserving consistency. Revision always considers new evidence as a better belief. Such new evidence is usually represented in the form of a propositional formula which must be preserved after the revision. Here, the Δps (PS-Merge) belief merging operator is extended in order to consider constraints, and ... -
6
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
...This is even worst in case of both the high dimensional and class-imbalanced datasets. To overcome the limitations of class-imbalanced data, we split the dataset using a random sub-sampling to balance them. Then, we apply the (alpha,beta)-k feature set method to select a better subset of features and combine their outputs to get a consolidated feature set for classifier training. To enhance classification performances, we propose an ensemble of classifiers that combine the classification outputs of base classifiers using the simplest and largely used majority voting approach. ... -
7
This site contains four packages of Mass and mass-based density estimation. 1. The first package is about the basic mass estimation (including one-dimensional mass estimation and Half-Space Tree based multi-dimensional mass estimation). This packages contains the necessary codes to run on MATLAB. 2. The second package includes source and object files of DEMass-DBSCAN to be used with the WEKA system. 3. The third package DEMassBayes includes the source and object files of a Bayesian...
-
8
Weka4OC GUI for Overlapping clustering
Weka4OC: Weka for Overlapping Clustering is a GUI extending WEKA
This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups. -
9
MSTParser
MSTParser is a non-projective dependency parser that searches for maxi
MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported. mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file: <dependency> <groupId>net.sourceforge.mstparser</groupId> <artifactId>mstparser</artifactId> ... -
Outplacement, Executive Coaching and Career Development | CareermindsBy helping to avoid the potential risks of RIFs or layoffs through our global outplacement services, companies can move forward with their goals while preserving their internal culture, employer brand, and bottom lines.
-
10
ME_DSS
Microemulsion Decision Support System
This application allow user to predict microemulsion region based on algorithm consisted of artificial neural networks and random forests. Those techniques combined create Decision Support System. Application was created as a part of project K/DSC/000033 subsidy for young researchers from Polish Ministry of Higher Education. -
11
Sentence Composer
Compose the writings semi-automatically
...Transduction, or transductive inference, tries to predict new outputs on specific and fixed (test) cases from observed, specific (training) cases. The simplest realization for transductive inference is the method of k-nearest neighbors. Learning to learn learns its own inductive bias based on previous experience. ...AND SO ON.... Enjoy the program ! -
12
JaCHMM
Java Conditioned Hidden Markov Model library
The JaCHMM - the Java Conditioned Hidden Markov Model library - is a complete implementation of a CHMM in Java ready to use either on command line or as a module. The JaCHMM is licenced under the BSD licence. It gives an implementation of the Viterbi, Forward-Backward, Baum-Welch and K-Means algorithms, all adapted for the CHMM. JaCHMM is based on the JaHMM and also designed to achieve reasonable performance without making the code unreadable. Consequently, it offers a good way of applying the Conditioned Hidden Markov Model in various tasks, e.g., for scientific or teaching purposes. -
13
P53 Cancer Rescue Project, University of California, Irvine , Samuel A. Danziger, Christopher Wassman, Faezeh Salehi Amiri, Roberta Baronio, Linda Hall, Rainer K. Brachmann, G. Wesley Hatfield, Peter Kaiser, Richard H. Lathrop
-
14
Multi-Partite Community Detection - community detection (aka graph clustering) in k-partite k-uniform hypergraphs
-
15
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
-
16
brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).
- Previous
- You're on page 1
- Next
