Search Results - (( using function method algorithm ) OR ( problem representation mining algorithm ))

Search alternatives:

Refine Results
  1. 1
    Dissimilarity algorithm on conceptual graphs to mine text outliers

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    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
    Save to List
    Saved in:
  2. 2
    Deviation detection in text using conceptual graph interchange format and error tolerance dissimilarity function

    Deviation detection in text using conceptual graph interchange format and error tolerance dissimilarity function by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    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
    Save to List
    Saved in:
  3. 3
    Compact structure representation in discovering frequent patterns for association rules

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, Norwati, Sulaiman, Md. Nasir, Othman, Mohamed, Selamat, Mohd Hasan

    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
    Save to List
    Saved in:
  4. 4
    Compact structure representation in discovering frequent patterns for association rules

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.

    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
    Save to List
    Saved in:
  5. 5
    Document classification based on kNN algorithm by term vector space reduction

    Document classification based on kNN algorithm by term vector space reduction by Moldagulova A., Sulaiman R.B.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  6. 6
    Scalable approach for mining association rules from structured XML data

    Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    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
    Save to List
    Saved in:
  7. 7
    Mining association rules from structured XML data

    Mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    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
    Save to List
    Saved in:
  8. 8
    USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING

    USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING by MUFLIKHAH, LAILIL

    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
    Save to List
    Saved in:
  9. 9
    Direct approach for mining association rules from structured XML data

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    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
    Save to List
    Saved in:
  10. 10
    Evolutionary-based feature construction with substitution for data summarization using DARA

    Evolutionary-based feature construction with substitution for data summarization using DARA by Sia, Florence, Alfred, Rayner

    Published 2012
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Pendiskretan data set kasar menggunakan ta’akulan boolean

    Pendiskretan data set kasar menggunakan ta’akulan boolean by Rokiah @ Rozita Ahmad, Maslina Darus, Siti Mariyam Shamsuddin, Azuraliza Abu Bakar

    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
    Save to List
    Saved in:
  12. 12
    Evolving fuzzy grammar for crime texts categorization

    Evolving fuzzy grammar for crime texts categorization by Mohd Sharef, Nurfadhlina, Martin, Trevor

    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
    Save to List
    Saved in:
  13. 13
    Finding the root of nonlinear function using five bracketing method / Nur Afiqah Mohamed Azhar

    Finding the root of nonlinear function using five bracketing method / Nur Afiqah Mohamed Azhar by Mohamed Azhar, Nur Afiqah

    Published 2019
    “…Therefore, numerical method in the form of bracketing method is often used to find only the approximate root of the function. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions

    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

    Published 2018
    “…The second technique is to solve bi-objective functions by using the BOBAT algorithm. The third technique is an integration of BOGSA with BOBAT to produce a BOGSBAT algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Determining the preprocessing clustering algorithm in radial basis function neural network

    Determining the preprocessing clustering algorithm in radial basis function neural network by S.L. Ang, H.C. Ong, H.C. Law

    Published 2008
    “…Three types of method used in this study to find the centres include random selections, K-means clustering algorithm and also K-median clustering algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Ranking-based pruning and weighted support model for gene association in frequent itemsets / Sofianita Mutalib

    Ranking-based pruning and weighted support model for gene association in frequent itemsets / Sofianita Mutalib by Mutalib, Sofianita

    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
    Save to List
    Saved in:
  17. 17
    Genetic Algorithms In Optimizing Membership Function For Fuzzy Logic Controller

    Genetic Algorithms In Optimizing Membership Function For Fuzzy Logic Controller by Ismail, H. Muh Yusuf

    Published 2010
    “…Thus it is important to select the accurate membership functions but these methods possess one common weakness where conventional FLC use membership function and control rules generated by human operator. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin

    The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin by Shamsudin, Siti Nur Hafiza

    Published 2019
    “…The global convergence result is established using exact line searches. Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…It shows that the IQR-HEOM method is more efficient to rectify the problem caused by using range in HEOM. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    A Proposed Method For Selecting The Clustering Algorithm In Radial Basis Function [QA223. A581 2008 f rb].

    A Proposed Method For Selecting The Clustering Algorithm In Radial Basis Function [QA223. A581 2008 f rb]. by Ang, Sau Loong

    Published 2008
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: