Search Results for "frequent subgraph mining"
Sort By:
Showing 14 open source projects for "frequent subgraph mining"
View related business solutions-
We design our technology to make workforce management easier. APS offers core HR, payroll, benefits administration, attendance, recruiting, employee onboarding, and more.
-
Chat with your business data with Looker. More than just a modern business intelligence platform, you can turn to Looker for self-service or governed BI, build your own custom applications with trusted metrics, or even bring Looker modeling to your existing BI environment.
-
1
This project aims to develop and share fast frequent subgraph mining and graph learning algorithms. Currently we release the frequent subgraph mining package FFSM and later we will include new functions for graph regression and classification package
-
2
When data mining techniques are applied to discover useful knowledge behind a large data collection, they are required to be able to preserve some confidential information, such as sensitive frequent itemsets, rules and the like. A feasible way to ensure the confidentiality is to sanitize the database and conceal sensitive information. However, the sanitization process often produces side effects, thus minimizing these side effects is an important task.
-
3
BISD
Batch incremental SNN-DBSCAN clustering algorithm
Incremental data mining algorithms process frequent up- dates to dynamic datasets efficiently by avoiding redundant computa- tion. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremen- tal algorithm to overcome both these bottlenecks by efficiently identify- ing affected parts of clusters while processing updates to dataset in batch... -
4
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}. -
Evolia is a web and mobile platform that connects enterprises with 1000’s of local shift workers and offers free workforce scheduling and time and attendance solutions. Is your business on Evolia?
-
5
LTS: Learning To Search
Discriminative subgraph mining by learning from search history
This is an optimized Java implementation of the algorithm from "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The Learning to Search (LTS) algorithm mines for discriminative subgraphs. Given two sets of graphs, with one set labelled positive, it finds subgraphs that are common in the positive graphs and uncommon in the negative graphs. In other words, the occurrences of these subgraphs... -
6
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
..., the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013. -
7
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
LTS (Learning to Search) is an implementation of an algorithm described in "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown... -
8
implementation of "GAIA: graph classification using evolutionary computation" in SIGMOD'10. a discriminative subgraph pattern mining algorithm using evolutionary computation implemented by the author
-
9
This open source project is aimed to create an efficient XML frequent pattern mining tool,which includes four main functions, TreeMining, Stream Mining, Sequence Mining and Version Mining.
-
Don’t settle when it comes to managing your clients’ IT infrastructure. Exceed their expectations with ConnectWise RMM, our MSP RMM software that provides proactive tools and NOC services—regardless of device environment. With the number of new vulnerabilities rising each year, smart patching procedures have never been more important. We automatically test and deploy patches when they are viable and restrict patches that are harmful. Get better protection for clients while you spend less time managing endpoints and more time growing your business. It’s tough to locate, afford, and retain quality talent. In fact, 81% of IT leaders say it’s hard to find the recruits they need. Add ConnectWise RMM, NOC services and get the expertise and problem resolution you need to become the advisor your clients demand—without adding headcount.
-
10
This project aims to create a method able to determine the most frequent word phrases in a large source of text data (>5 Gb) using the computational power of multiple processors.
-
11
It is the source code for a tree mining algorithm called TRIPS. It can mine frequent subtrees from a forest of tree structures.
-
12
Data mining tool for the extraction of spatio-temporal frequent patterns ("Trajectory patterns" or "T-patterns") from GPS-like trajectories of a set of moving objects. Work performed within the European project GeoPKDD - www.geopkdd.eu
-
13
baobab is an implementation of FPTrees or Frequent Pattern Trees, a pattern recognition/data mining technique. it has innumerable applications in language processing, clickstream analysis, etc.
-
14
DMTL (Data Mining Template Library) - A generic C++ based library for mining structured patterns such as sets, sequences, trees and graphs. The library provides implementation of popular frequent pattern mining algorithms.
- Previous
- You're on page 1
- Next