English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Decision tree is one of the most significant classification methods applied in data mining. By its graphic output, users could have an easy way to interpret the decision flow and the mining outcome. However, decision tree is known to be time consuming. It will spend a high computation cost when mining the large scale dataset in the real world. This drawback causes decision tree to be ineligible in processing the time critical applications. In these years, we have introduced the query-based learning (QBL) method to different neural networks for providing a more effective way to learn the large dataset. These neural networks have achieved good clustering and classification results. In this paper, a novel mining scheme called QBLDT (query-based learning decision tree) is proposed to apply the QBL concept in decision tree construction. Experimental results show our proposed method is better than the traditional decision tree in different performance metrics. It makes learning quicker and can achieve better prediction results.

Query-Based Learning Decision Tree and its Applications in Data Mining