scholarly journals Semantic Search for Scientific Articles by Language Using Cosine Similarity Algorithm and Weighted Tree Similarity

2021 ◽  
Vol 5 (2) ◽  
pp. 106-114
Author(s):  
Muhamad Aldi Rifai ◽  
Indra Gita Anugrah
Keyword(s):  
Cosine Similarity ◽  
Scientific Article ◽  
Weighted Tree ◽  
Abstract Section ◽  
Language Differences ◽  
Search Results ◽  
Similarity Algorithm ◽  
Tree Similarity ◽  
N Gram ◽  
The Right

The activity of writing scientific articles by academics at universities is one of the activities that is often carried out, but when writing scientific articles problems arise regarding the difficulty of finding ideas, literature studies, and reference sources that you want to use as references when writing. Sometimes when searching on a search engine, we have trouble finding the right document, because usually, the keywords we are looking for are not in the title section but another part of the structure. Since most search engines only match titles, other structures are usually excluded from matching. So that the search results that we do sometimes don't match what we want. In addition, usually, each scientific article has many language differences in its structure as found in the abstract section. To detect similarities through the structure of scientific articles, an algorithm is used, namely weighted tree similarity, and to detect language using the N-gram algorithm, then the cosine similarity algorithm can be used to check the level of similarity in keyword text with text in scientific articles.

scholarly journals Algoritma Extended Weighted Tree Similarity untuk Memberikan Solusi Memasak pada J2ME

d'CARTESIAN ◽  
2012 ◽  
Vol 1 (1) ◽  
pp. 1
Author(s):  
Halim Yosephine ◽  
Somya Ramos ◽  
Fibriani Charitas
Keyword(s):  
Mobile Technology ◽  
Weighted Tree ◽  
Highest Weight ◽  
Similarity Algorithm ◽  
Tree Similarity

Abstract The aim of this thesis is to give the simplicity in cooking with limited ingredients for the users by using mobile technology (J2ME). The aim of this thesis can be done by using Extended Weighted Tree Similarity Algorithm, a calculation to find out the highest weight similarity between the menu which has been inputted in the application as a database; and the inputted ingredients from the users of this application. The conclusion of this thesis is that Algorithm Extended Weighted Tree Similarity can be implemented into mobile technology (J2ME).  Keywords: extended weighted tree similarity, cooking smart, J2ME Abstrak Tujuan dari penelit ian ini adalah   memberikan kemudahan dalam memasak dengan bahan yang terbatas bagi pengguna  dengan menggunakan  teknologi  mobile  (J2ME).  Tujuan dari  tesis ini  dapat dilakukan dengan menggunakan  Algoritma  Extended Weighted Tree Similarity, perhitungan  untuk mengetahui  kesamaan  bobot  tertinggi antara menu  yang telah  diinput  dalam aplikasi  sebagai  database, dan  bahan-bahan  dimasukkan  dari  pengguna  aplikasi ini.  Kesimpulan dari  tesis ini  adalah bahwa  Algoritma Extended Weighted Tree Similarity dapat diimplementasikan ke dalam teknologi mobile (J2ME).  Kata Kunci : extended weighted tree similarity, cooking smart, J2ME

scholarly journals Implementation of Weighted Tree Similarity and Cosine Sorensen-Dice Algorithms for Semantic Search in Document Repository Information System

2021 ◽  
Vol 5 (1) ◽  
pp. 21-27
Author(s):  
Abdurrosyiid amrullah ◽  
Indra Gita Anugrah
Keyword(s):  
Information Retrieval ◽  
Information Needs ◽  
Retrieval System ◽  
Semantic Search ◽  
Text Search ◽  
Weighted Tree ◽  
File Storage ◽  
Document Search ◽  
Similarity Algorithm ◽  
Tree Similarity

As more and more documents we manage, the more difficult it is in the search process, and the need to use information retrieval becomes important. With the information retrieval system, it can help in searching for documents that match the similarity of keywords. Usually document searches usually only see the name of the document (file) being searched for by the user without paying attention to the content or metadata of the document, so that it cannot meet their information needs. Document search has several approaches, including full-text search, plain metadata search and semantic search. This study uses the Weighted Tree Similarity algorithm with the Cosine Sorensen Dice algorithm to calculate the semantic search similarity. In this study, document metadata is represented in the form of a tree that has labeled nodes, labeled branches and weighted branches. The similarity calculation on the subtree edge label uses Cosine Sorensen Dice, while the total similarity of a document uses the weighted tree similarity. The metadata structure of the document uses the taxonomy owner, description, title, disposition content and type. The result of this research is a document search application with taxonomic weight on file storage.

scholarly journals OPTIMASI MESIN PENCARI BUKU FIKSI BERDASARKAN PADA SEMANTIK IMPRESI

2021 ◽  
Vol 5 (1) ◽  
pp. 1-8
Author(s):  
Rengga Asmara ◽  
◽  
Nur Rasyid Mubtadai ◽  
Varidh Bimantara
Keyword(s):  
Text Mining ◽  
Survey Data ◽  
Error Rate ◽  
Special Interest ◽  
Cosine Similarity ◽  
Application System ◽  
Final Project ◽  
Search Results ◽  
Similarity Algorithm

Fiction books are one of the most popular types of books in Indonesia. There are five most popular genres in fiction books, namely fantasy, mystery, romance, sci-fi, and thriller. Each genre gives a different impression and special interest for readers. It has become a common habit when people choose a fiction book based on the title, author, or publisher of the book. However, it does not provide precise search results. In this final project, an application system was developed to find out fiction books based on semantic impressions on the cover of the fiction book. The impression on each book cover is obtained through a survey of fiction book lovers in Indonesia. To get the results of the closeness between the user search and the impression survey data obtained through text mining, as well as the cosine similarity algorithm to calculate the most precise proximity value to the impression the user expects. The results of this system display a fiction book that has a closeness value with an error rate of 3.93% based on the impression expected by the user.

Analisis Perbandingan Metode Vector Space Model dan Weighted Tree Similarity dengan Cosine Similarity pada kasus Pencarian Informasi Pedoman Pengobatan Dasar di Puskesmas

2016 ◽  
Vol 4 (2) ◽  
pp. 73
Author(s):  
Viko Basmalah Wicaksono ◽  
Ristu Saptono ◽  
Sari Widya Sihwi
Keyword(s):  
Vector Space ◽  
Hamming Distance ◽  
Vector Space Model ◽  
Cosine Similarity ◽  
Weighted Tree ◽  
Space Model ◽  
Tree Similarity

<p class="keywords">Sistem pencarian merupakan salah satu solusi yang dapat membantu dalam mendapatkan informasi yang diinginkan. Dengan sistem pencarian, proses pencarian informasi akan menjadi lebih efisien. Sistem pencarian informasi pada ebook pedoman pengobatan di puskesmas sangat dibutuhkan karena terdapat banyak data penyakit di dalamnya. Dalam mengembangkan sistem pencarian pada pedoman pengobatan di puskesmas, dapat memanfaatkan metode Vector Space Model (VSM) atau Weighted Tree Similarity (WTS). Penelitian ini membandingkan metode VSM dengan WTS untuk mendapatkan metode terbaik. Selain itu, ditambahkan algoritma Hamming Distance untuk mengetahui pengaruh eksekusi waktu sistem.</p><p class="keywords">Penelitian ini menunjukkan bahwa WTS lebih baik dibandingkan VSM, hal ini dapat dilihat pada hasil pengujian, nilai precision pada WTS lebih baik dibandingkan VSM. Karena pada metode pencarian yang efektif adalah yang memberikan nilai ketepatan(precision) terbaik, meskipun nilai recall lebih rendah.  Pada pengujian sistem, VSM menunjukkan hasil nilai rata – rata precision sebesar 44,82983 % dan recall sebesar 99,08165 %. Sedangkan pada WTS nilai rata – rata  precision sebesar 52,17332% dan recall sebesar 98,61761%. Kemudian pada pengujian pakar menunjukkan precision WTS dengan rata – rata sebesar 46,675% dan recall sebesar 73,6111%. Sedangkan nilai precision VSM sebesar 33,6737% dan  nilai recall sebesar 86,8056%.</p>Algoritma Hamming Distance sangat membantu dalam mempercepat eksekusi sistem. Pengaruh penggunaan algoritma Hamming Distance pada VSM memberikan hasil denganrata – rata waktu pengujian adalah 4,512 detik, sedangkan tanpa Hamming Distance adalah 9,185 detik. Kemudian Pada metode WTS dengan Hamming Distance memberikan hasil rata – rata dengan waktu pengujian adalah 6,042 detik, sedangkan tanpa Hamming Distance adalah 14,421 detik

Legal nature of individual proceedings in cases of granting the right to marriage

2021 ◽  
pp. 88-93
Author(s):  
T.M. Balyuk
Keyword(s):  
Family Law ◽  
Adoptive Parent ◽  
Intangible Asset ◽  
Scientific Article ◽  
Adopted Child ◽  
Legitimate Interest ◽  
Civil Proceedings ◽  
Legal Nature ◽  
Specific Material ◽  
The Right

The scientific article is devoted to the study of the legal nature of separate proceedings in cases of granting the right to marry.It is established that a separate proceeding as a type of non-litigious civil proceedings is characterized by: 1) the absence of a dispute about the right, which, at the same time, does not exclude the existence of a dispute about the fact; 2) a special object of judicial protection – a legally protected (legitimate) interest, which is the needs and aspi-rations to use a specific material and (or) intangible asset, which may or may not be mediated by a certain subjective right. Protection of legally protected (legal) interest is carried out by the court by deciding on the presence or absence of legal facts relevant to the protection of rights, freedoms and interests of a person or creating conditions for the exercise of personal non-property or property rights or confirmation of the presence or absence of undisputed rights.It is determined that a separate proceeding in cases of granting the right to marry is a type of non-litigious civil proceedings for consideration of applications for confirmation of the presence or absence of legal facts that are im-portant for creating conditions for a person’s right to marry. It is substantiated that the legal nature of separate proceedings in cases of granting the right to marry is a set of substantive grounds for granting the right to marry and features of the procedural form of consideration by the court of relevant applications that mediate changes in family law. The court, establishing the presence or absence of legal facts, decides to grant a person the right to marry, thereby expanding the family law capacity of such a person due to the ability to exercise the right to marry before reaching marriageable age or marry between the adopter’s adopted child and the adopted child, as well as between children who have been adopted by an adoptive parent.

Sign in / Sign up

Export Citation Format

Share Document