An MDL-Based Frequent Itemset Hierarchical Clustering Technique to Improve Query Search Results of an Individual Search Engine

Puspitaningrum, Diyah; Fauzi,; Susilo, Boko; Pagua, Jeri Apriansyah; Erlansari, Aan; Andreswari, Desi; Efendi, Rusdi; Prasetya, I. S. W. B.

doi:10.1007/978-3-319-28940-3_22

Cited by 2 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thirty multi domain queries are used in this comparison. Also, since combining multiple datasets can lead into better accuracy [14], for example as a meta-search engine [18], we propose the use of meta-pseudo relevance feedback (meta-PRF) for automatic judgement purpose as in [17] [18]. Our experiments show benefit of IR performance when using Wiki-MetaSemantik.…”

Section: Introductionmentioning

confidence: 90%

Wiki-MetaSemantik: A Wikipedia-derived query expansion approach based on network properties

Puspitaningrum

Yulianti

Prasetya

2017

2017 5th International Conference on Cyber and IT Service Management (CITSM)

Self Cite

View full text Add to dashboard Cite

Abstract-This paper discusses the use of Wikipedia for building semantic ontologies to do Query Expansion (QE) in order to improve the search results of search engines. In this technique, selecting related Wikipedia concepts becomes important. We propose the use of network properties (degree, closeness, and pageRank) to build an ontology graph of user query concept which is derived directly from Wikipedia structures. The resulting expansion system is called Wiki-MetaSemantik. We tested this system against other online thesauruses and ontology based QE in both individual and meta-search engines setups. Despite that our system has to build a Wikipedia ontology graph in order to do its work, the technique turns out to works very fast (1:281) compared to other ontology QE baseline (Persian Wikipedia ontology QE). It has thus the potential to be utilized online. Furthermore, it shows significant improvement in accuracy. Wiki-MetaSemantik shows better performance in a meta-search engine (MSE) set up rather than in an individual search engine set up.

show abstract

Section: Introductionmentioning

confidence: 90%

Wiki-MetaSemantik: A Wikipedia-derived query expansion approach based on network properties

Puspitaningrum

Yulianti

Prasetya

2017

2017 5th International Conference on Cyber and IT Service Management (CITSM)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The algorithm itself produces an excellent representative model of a database since the KRIMP mining only the most frequent/interesting patterns that compress the database best. Many researchers have investigated Krimp implementation in many applications, such as in clustering, classification, and recommender system (see [14][13][7] [8]). In the Information Retrieval area, for the relation extraction problem, the KRIMP algorithm can be used to grab only the interesting itemsets taken from the database summary called code table.…”

Section: Introductionmentioning

confidence: 99%

Improving Performance of Relation Extraction Algorithm via Leveled Adversarial PCNN and Database Expansion

Puspitaningrum

2019

2019 7th International Conference on Cyber and IT Service Management (CITSM)

Self Cite

View full text Add to dashboard Cite

This study introduces database expansion using the Minimum Description Length (MDL) algorithm to expand the database for better relation extraction. Different from other previous relation extraction researches, our method improves system performance by expanding data. The goal of database expansion, together with a robust deep learning classifier, is to diminish wrong labels due to the incomplete or not found nature of relation instances in the relation database (e.g., Freebase). The study uses a deep learning method (Piecewise Convolutional Neural Network or PCNN) as the base classifier of our proposed approach: the leveled adversarial attention neural networks (LATTADV-ATT). In the database expansion process, the semantic entity identification is used to enlarge new instances using the most similar itemsets of the most common patterns of the data to get its pairs of entities. About the deep learning method, the use of attention of selective sentences in PCNN can reduce noisy sentences. Also, the use of adversarial perturbation training is useful to improve the robustness of system performance. The performance even further is improved using a combination of leveled strategy and database expansion. There are two issues: 1) database expansion method: rule generation by allowing step sizes on selected strong semantic of most similar itemsets with aims to find entity pair for generating instances, 2) a better classifier model for relation extraction. Experimental result has shown that the use of the database expansion is beneficial. The MDL database expansion helps improvements in all methods compared to the unexpanded method. The LATTADV-ATT performs as a good classifier with high precision P@100=0.842 (at no expansion). It is even better while implemented on the expansion data with P@100=0.891 (at expansion factor k=7).

show abstract

An MDL-Based Frequent Itemset Hierarchical Clustering Technique to Improve Query Search Results of an Individual Search Engine

Cited by 2 publications

References 17 publications

Wiki-MetaSemantik: A Wikipedia-derived query expansion approach based on network properties

Wiki-MetaSemantik: A Wikipedia-derived query expansion approach based on network properties

Improving Performance of Relation Extraction Algorithm via Leveled Adversarial PCNN and Database Expansion

Contact Info

Product

Resources

About