Search Results - (( parallel optimization path algorithm ) OR ( problem representation mining algorithm ))
Search alternatives:
- problem representation »
- parallel optimization »
- representation mining »
- optimization path »
- mining algorithm »
- path algorithm »
-
1
Dissimilarity algorithm on conceptual graphs to mine text outliers
Published 2009“…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
2
Tool path generation of contour parallel based on ant colony optimisation
Published 2016“…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
Get full text
Get full text
Article -
3
Compact structure representation in discovering frequent patterns for association rules
Published 2002“…Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. …”
Get full text
Get full text
Get full text
Article -
4
Compact structure representation in discovering frequent patterns for association rules
Published 2002“…Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. …”
Get full text
Get full text
Get full text
Article -
5
Minimizing machining airtime motion with an ant colony algorithm
Published 2016Get full text
Get full text
Article -
6
Document classification based on kNN algorithm by term vector space reduction
Published 2023Conference Paper -
7
Scalable approach for mining association rules from structured XML data
Published 2009“…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text
Conference or Workshop Item -
8
-
9
Mining association rules from structured XML data
Published 2009“…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text
Conference or Workshop Item -
10
USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING
Published 2010“…Based on the new representation, the documents are then subjected to the clustering algorithm itself, which is Fuzzy c-Means algorithm. …”
Get full text
Get full text
Thesis -
11
Direct approach for mining association rules from structured XML data
Published 2012“…Having the ability to extract information from XML data would answer the problem of mining the web contents which is a very useful and required power nowadays. …”
Get full text
Get full text
Thesis -
12
Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib
Published 2019“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
Get full text
Get full text
Get full text
Thesis -
13
Deviation detection in text using conceptual graph interchange format and error tolerance dissimilarity function
Published 2012“…We resolve two non-trivial problems, i.e. semantic representation of text and the complexity of graph matching. …”
Get full text
Get full text
Get full text
Article -
14
Evolutionary-based feature construction with substitution for data summarization using DARA
Published 2012Get full text
Get full text
Get full text
Conference or Workshop Item -
15
A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors
Published 2008“…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
Get full text
Thesis -
16
Pendiskretan data set kasar menggunakan ta’akulan boolean
Published 2004“…Data discretization of rough set towards real attribute values is one of the important aspect in the data mining concepts, particularly the ones which involved classification problems. …”
Get full text
Get full text
Get full text
Article -
17
Evolving fuzzy grammar for crime texts categorization
Published 2015“…Machine learning (ML) based methods are the popular solution for this problem. However, the developed models typically provide low expressivity and lacking in human-understandable representation. …”
Get full text
Get full text
Get full text
Article -
18
A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks
Published 2016“…A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
Get full text
Get full text
Conference or Workshop Item -
19
Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques
Published 2017“…In this thesis, a hybrid detection algorithm mechanism has been proposed which combines two detection algorithms based on nodes’ trustworthiness and energy consumption in a parallel manner in order to detect the black hole nodes. …”
Get full text
Get full text
Get full text
Thesis -
20
Ranking-based pruning and weighted support model for gene association in frequent itemsets / Sofianita Mutalib
Published 2019“…High dimensional dataset presented by SNPs confirmed the reason to apply row enumeration strategy algorithm to mine frequent closed itemsets. It is found that SNPs with known risks to Type 2 Diabetes Mellitus (T2DM) occur in low support values, that cause the process of searching frequent itemsets to be repeated many times until the low support values are retrieved. …”
Get full text
Get full text
Thesis
