Khatalyn Mata - Academia.edu (original) (raw)
Papers by Khatalyn Mata
International journal of research publications, May 1, 2022
2022 2nd International Conference in Information and Computing Research (iCORE), Dec 1, 2022
International Journal of Computing Sciences Research
International Journal for Research in Applied Science and Engineering Technology
Hill Cipher algorithm is a Polygraphic cipher known to be vulnerable to the Known-Plaintext attac... more Hill Cipher algorithm is a Polygraphic cipher known to be vulnerable to the Known-Plaintext attack. It is a type of attack wherein the attacker has access to a pair of Plaintext and Ciphertext. Possible leaked information can be used to reveal critical data which can include the private key that is used in the encryption of the plaintext. In this study, the researchers propose an improved scheme by incorporating Myszkowski transposition in the algorithm to address the specified problem. Runtime Test and Statistical test such as the Avalanche effect were used to evaluate the performance of the algorithm. The test yielded a 25.70% faster runtime based on previous modifications and a 52.78% Avalanche Effect. Randomness test such as the Monobit test, Runs Test and Longest Run of Ones in a Block test were applied to evaluate the ciphertext produced. The criterion for the Randomness Test requires its p-value to be greater than 0.01, the evaluation showed a 0.249, 0.167 and 0.368 p-value, respectively. The proposed scheme proved that the algorithm is cryptographically secure and efficient as all tests yielded favorable results.
International journal of research publications, May 1, 2022
BIRCH algorithm uses the concept of radius to manage cluster boundaries, which yields good result... more BIRCH algorithm uses the concept of radius to manage cluster boundaries, which yields good results when clustering spherical data but unsatisfactory results when clustering non-spherical data. In which, it splits non-spherical data into several clusters in some circumstances. This paper proposed an enhancement to the BIRCH algorithm that allows it to cluster non-spherical data. The result of the experiment in this paper shows Enhanced BIRCH algorithm performs better than the BIRCH algorithm in clustering non-spherical datasets.
Zenodo (CERN European Organization for Nuclear Research), May 18, 2022
The Deep Feature Synthesis (DFS) algorithm automates feature engineering and is capable of extrac... more The Deep Feature Synthesis (DFS) algorithm automates feature engineering and is capable of extracting and applying complicated features to a variety of processes. Due to the novelty of DFS as a method for feature engineering, critical ways for dealing with missing values and unwanted data in a dataset have yet to be established. This paper discusses the usage of mean, median, and mode imputation to preprocess data before analyzing it. However, it is only limited to displaying the differences between nonimputed and imputed datasets. This strategy enables users to obtain more precise results by eliminating biased estimations. This study demonstrates that there is a distinct difference between the two datasets. This paper is concluded by proving that imputing datasets will cause distinctness in the results compared to the results of the datasets with missing and unwanted values.
International journal of research publications, Apr 16, 2022
In the age of information, vast amount of data is within the grasp of everyone. The availability ... more In the age of information, vast amount of data is within the grasp of everyone. The availability and amount of information is absurd that it could lead to information overload. Recommender systems exist so that it could recommend information that are relevant and appropriate based on user's preference. Content-based filtering (CBF) is a recommender system approach that focuses solely on user preference and content of an item. CBF works by recommending items that satisfies user's interest based on user's previously liked items. CBF suffers the problem of overspecialization or also called the serendipity problem. Overspecialization occurs when the items that are being recommended is very similar to the previously liked item of the user, thus, not being able to recommend unexpected recommendations. The researchers used a pure content-based approach in eliminating the overspecialization problem. The researchers' first method is to use K-Nearest Neighbors (KNN) algorithm to find the nearest neighbors of the top recommended items. The researchers' premise is to recommend similar items of similar items. The researchers' second method is to use the percentile concept in the cosine similarity matrix of all the items. This method lets the researchers prevent overspecialization by recommending items that are in the lower percentiles since overspecialization occurs in the higher percentiles. The result of this study shows that the first and second are effective in preventing overspecialization because these methods recommended unexpected yet relevant items.
Zenodo (CERN European Organization for Nuclear Research), Jul 5, 2022
In the interest of digital security, 2-Factor Authentication (2FA), has been widely used througho... more In the interest of digital security, 2-Factor Authentication (2FA), has been widely used throughout different sites and applications to secure and authenticate a user's identity, Time-Based One-Time Password (TOTP) algorithm is one of the most utilized algorithms when it comes to 2FA due to its reliability when it comes to securing user access through generating a code that has a limited validity, usually for 30 seconds or less. TOTP generates a code with the use of current time and a secret key. Despite the security TOTP provides, the delivery of the code through SMS is still vulnerable to interception by a third party since the connection between the client and the server can be insecure. This paper proposes an enhancement to the TOTP algorithm by applying AES encryption to the generated code before delivering it to the client. This paper shows that the implementation of AES to the TOTP algorithm has helped generate a stronger OTP and has made it harder for hackers to crack.
2022 8th International Conference on Computer Technology Applications
International Journal of Research Publications
The Super Sort Sorting algorithm is a sorting algorithm that uses forward selection, backward sel... more The Super Sort Sorting algorithm is a sorting algorithm that uses forward selection, backward selection, merging, and partition to sort a given list or data set. This study will focus on the enhancement of the Super Sort Sorting Algorithm on the forward selection part. This paper introduces an enhanced version of the algorithm where the concept of Identical Value Search was implemented on the first forward pass. This method eliminated the small sublists left behind by the original algorithm's forward pass and reduced the overall runtime of the algorithm.
International Journal of Research Publications
TextRank Algorithm is an unsupervised graph-based algorithm by Mihalcea with two primary applicat... more TextRank Algorithm is an unsupervised graph-based algorithm by Mihalcea with two primary applications, namely in text summarization and keyword extraction of a text document. This study will focus on the enhancement of the TextRank algorithm on the keyword extraction side. This paper introduces an enhanced version of the algorithm wherein the whole text document is preprocessed with a method known as Coreference Resolution, wherein this method normalizes every referenced entity in a text into a single entity. The application of this method to a document text with a longer sequence, outperforms the Precision, Recall, F1-Measure, and the Mean Average Precision metrics of the original algorithm.
2021 7th International Conference on Computer and Communications (ICCC), 2021
In recent years, many modifications have been done to combat the weaknesses of the Vigenère Ciphe... more In recent years, many modifications have been done to combat the weaknesses of the Vigenère Cipher Algorithm. Several studies have been carried out to rectify the flaw of the algorithm’s repeating key nature by increasing the key length equal to that of the plain text. However, some characters cannot be encrypted due to the limited set of characters in the key. This paper modified the algorithm’s key generation process using a Pseudo-Random Number Generator to improve the algorithm’s security and expanded the table of characters to up to 190 characters. The results show that based on Monobit examination and frequency analysis, the repeating nature of the key is non-existent, and the generated key can be used to encrypt a larger set of characters. The ciphertext has a low IC value of 0.030, which is similar to a random string and polyalphabetic cipher with an IC value of 0.038 but not equal to a monoalphabetic cipher with an IC value of 0.065. Results show that the modified version of the algorithm performs better than some of the recent studies conducted on it
Abstract- This paper aims to form an application for providers in able to analyze the buying habi... more Abstract- This paper aims to form an application for providers in able to analyze the buying habits of their customers. At the same time, in able to provide a usable and time able information of the products/items for the customer so that they will be satisfied in their shopping. Moreover, the following problems will be solved once the application is formed, (1) How can providers analyze the buying pattern / behavior of a specific customer? (2) How can provider be able to send an up to date information to the customer?, (3) The system has to be tested based from the timeliness and its usability.
International Journal of Advanced Trends in Computer Science and Engineering, 2020
The main purpose of this study is to design and develop a system software with intelligent agent ... more The main purpose of this study is to design and develop a system software with intelligent agent using artificial neural network for the Bureau of Fire Protection to streamline the process for the application of fire safety certificates and to provide quality public service. Embedded on the system are the intelligent agent, artificial neural network, Information and Communication Technology, and Service quality dimensions which can provide prompt services for the applicant of fire safety certificates. A modified service quality dimension scale was used to assess the system. The result of the assessment shows a significant improvement on delivering quality public service. The use artificial neural network and intelligent agent on the system is very effective. The advancement on the technology proved that the study could minimize the number of processes and can provide quality public service in applying fire safety certificates and it is capable to communicate to the applicant of fire safety certificate using artificial neural network. It also provides information, notification and generate report in real time.
2021 7th International Conference on Computer and Communications (ICCC)
In recent years, many modifications have been done to combat the weaknesses of the Vigenè re Ciph... more In recent years, many modifications have been done to combat the weaknesses of the Vigenè re Cipher Algorithm. Several studies have been carried out to rectify the flaw of the algorithm's repeating key nature by increasing the key length equal to that of the plain text. However, some characters cannot be encrypted due to the limited set of characters in the key. This paper modified the algorithm's key generation process using a Pseudo-Random Number Generator to improve the algorithm's security and expanded the table of characters to up to 190 characters. The results show that based on Monobit examination and frequency analysis, the repeating nature of the key is nonexistent, and the generated key can be used to encrypt a larger set of characters. The ciphertext has a low IC value of 0.030, which is similar to a random string and polyalphabetic cipher with an IC value of 0.038 but not equal to a monoalphabetic cipher with an IC value of 0.065. Results show that the modified version of the algorithm performs better than some of the recent studies conducted on it
International journal of research publications, May 1, 2022
2022 2nd International Conference in Information and Computing Research (iCORE), Dec 1, 2022
International Journal of Computing Sciences Research
International Journal for Research in Applied Science and Engineering Technology
Hill Cipher algorithm is a Polygraphic cipher known to be vulnerable to the Known-Plaintext attac... more Hill Cipher algorithm is a Polygraphic cipher known to be vulnerable to the Known-Plaintext attack. It is a type of attack wherein the attacker has access to a pair of Plaintext and Ciphertext. Possible leaked information can be used to reveal critical data which can include the private key that is used in the encryption of the plaintext. In this study, the researchers propose an improved scheme by incorporating Myszkowski transposition in the algorithm to address the specified problem. Runtime Test and Statistical test such as the Avalanche effect were used to evaluate the performance of the algorithm. The test yielded a 25.70% faster runtime based on previous modifications and a 52.78% Avalanche Effect. Randomness test such as the Monobit test, Runs Test and Longest Run of Ones in a Block test were applied to evaluate the ciphertext produced. The criterion for the Randomness Test requires its p-value to be greater than 0.01, the evaluation showed a 0.249, 0.167 and 0.368 p-value, respectively. The proposed scheme proved that the algorithm is cryptographically secure and efficient as all tests yielded favorable results.
International journal of research publications, May 1, 2022
BIRCH algorithm uses the concept of radius to manage cluster boundaries, which yields good result... more BIRCH algorithm uses the concept of radius to manage cluster boundaries, which yields good results when clustering spherical data but unsatisfactory results when clustering non-spherical data. In which, it splits non-spherical data into several clusters in some circumstances. This paper proposed an enhancement to the BIRCH algorithm that allows it to cluster non-spherical data. The result of the experiment in this paper shows Enhanced BIRCH algorithm performs better than the BIRCH algorithm in clustering non-spherical datasets.
Zenodo (CERN European Organization for Nuclear Research), May 18, 2022
The Deep Feature Synthesis (DFS) algorithm automates feature engineering and is capable of extrac... more The Deep Feature Synthesis (DFS) algorithm automates feature engineering and is capable of extracting and applying complicated features to a variety of processes. Due to the novelty of DFS as a method for feature engineering, critical ways for dealing with missing values and unwanted data in a dataset have yet to be established. This paper discusses the usage of mean, median, and mode imputation to preprocess data before analyzing it. However, it is only limited to displaying the differences between nonimputed and imputed datasets. This strategy enables users to obtain more precise results by eliminating biased estimations. This study demonstrates that there is a distinct difference between the two datasets. This paper is concluded by proving that imputing datasets will cause distinctness in the results compared to the results of the datasets with missing and unwanted values.
International journal of research publications, Apr 16, 2022
In the age of information, vast amount of data is within the grasp of everyone. The availability ... more In the age of information, vast amount of data is within the grasp of everyone. The availability and amount of information is absurd that it could lead to information overload. Recommender systems exist so that it could recommend information that are relevant and appropriate based on user's preference. Content-based filtering (CBF) is a recommender system approach that focuses solely on user preference and content of an item. CBF works by recommending items that satisfies user's interest based on user's previously liked items. CBF suffers the problem of overspecialization or also called the serendipity problem. Overspecialization occurs when the items that are being recommended is very similar to the previously liked item of the user, thus, not being able to recommend unexpected recommendations. The researchers used a pure content-based approach in eliminating the overspecialization problem. The researchers' first method is to use K-Nearest Neighbors (KNN) algorithm to find the nearest neighbors of the top recommended items. The researchers' premise is to recommend similar items of similar items. The researchers' second method is to use the percentile concept in the cosine similarity matrix of all the items. This method lets the researchers prevent overspecialization by recommending items that are in the lower percentiles since overspecialization occurs in the higher percentiles. The result of this study shows that the first and second are effective in preventing overspecialization because these methods recommended unexpected yet relevant items.
Zenodo (CERN European Organization for Nuclear Research), Jul 5, 2022
In the interest of digital security, 2-Factor Authentication (2FA), has been widely used througho... more In the interest of digital security, 2-Factor Authentication (2FA), has been widely used throughout different sites and applications to secure and authenticate a user's identity, Time-Based One-Time Password (TOTP) algorithm is one of the most utilized algorithms when it comes to 2FA due to its reliability when it comes to securing user access through generating a code that has a limited validity, usually for 30 seconds or less. TOTP generates a code with the use of current time and a secret key. Despite the security TOTP provides, the delivery of the code through SMS is still vulnerable to interception by a third party since the connection between the client and the server can be insecure. This paper proposes an enhancement to the TOTP algorithm by applying AES encryption to the generated code before delivering it to the client. This paper shows that the implementation of AES to the TOTP algorithm has helped generate a stronger OTP and has made it harder for hackers to crack.
2022 8th International Conference on Computer Technology Applications
International Journal of Research Publications
The Super Sort Sorting algorithm is a sorting algorithm that uses forward selection, backward sel... more The Super Sort Sorting algorithm is a sorting algorithm that uses forward selection, backward selection, merging, and partition to sort a given list or data set. This study will focus on the enhancement of the Super Sort Sorting Algorithm on the forward selection part. This paper introduces an enhanced version of the algorithm where the concept of Identical Value Search was implemented on the first forward pass. This method eliminated the small sublists left behind by the original algorithm's forward pass and reduced the overall runtime of the algorithm.
International Journal of Research Publications
TextRank Algorithm is an unsupervised graph-based algorithm by Mihalcea with two primary applicat... more TextRank Algorithm is an unsupervised graph-based algorithm by Mihalcea with two primary applications, namely in text summarization and keyword extraction of a text document. This study will focus on the enhancement of the TextRank algorithm on the keyword extraction side. This paper introduces an enhanced version of the algorithm wherein the whole text document is preprocessed with a method known as Coreference Resolution, wherein this method normalizes every referenced entity in a text into a single entity. The application of this method to a document text with a longer sequence, outperforms the Precision, Recall, F1-Measure, and the Mean Average Precision metrics of the original algorithm.
2021 7th International Conference on Computer and Communications (ICCC), 2021
In recent years, many modifications have been done to combat the weaknesses of the Vigenère Ciphe... more In recent years, many modifications have been done to combat the weaknesses of the Vigenère Cipher Algorithm. Several studies have been carried out to rectify the flaw of the algorithm’s repeating key nature by increasing the key length equal to that of the plain text. However, some characters cannot be encrypted due to the limited set of characters in the key. This paper modified the algorithm’s key generation process using a Pseudo-Random Number Generator to improve the algorithm’s security and expanded the table of characters to up to 190 characters. The results show that based on Monobit examination and frequency analysis, the repeating nature of the key is non-existent, and the generated key can be used to encrypt a larger set of characters. The ciphertext has a low IC value of 0.030, which is similar to a random string and polyalphabetic cipher with an IC value of 0.038 but not equal to a monoalphabetic cipher with an IC value of 0.065. Results show that the modified version of the algorithm performs better than some of the recent studies conducted on it
Abstract- This paper aims to form an application for providers in able to analyze the buying habi... more Abstract- This paper aims to form an application for providers in able to analyze the buying habits of their customers. At the same time, in able to provide a usable and time able information of the products/items for the customer so that they will be satisfied in their shopping. Moreover, the following problems will be solved once the application is formed, (1) How can providers analyze the buying pattern / behavior of a specific customer? (2) How can provider be able to send an up to date information to the customer?, (3) The system has to be tested based from the timeliness and its usability.
International Journal of Advanced Trends in Computer Science and Engineering, 2020
The main purpose of this study is to design and develop a system software with intelligent agent ... more The main purpose of this study is to design and develop a system software with intelligent agent using artificial neural network for the Bureau of Fire Protection to streamline the process for the application of fire safety certificates and to provide quality public service. Embedded on the system are the intelligent agent, artificial neural network, Information and Communication Technology, and Service quality dimensions which can provide prompt services for the applicant of fire safety certificates. A modified service quality dimension scale was used to assess the system. The result of the assessment shows a significant improvement on delivering quality public service. The use artificial neural network and intelligent agent on the system is very effective. The advancement on the technology proved that the study could minimize the number of processes and can provide quality public service in applying fire safety certificates and it is capable to communicate to the applicant of fire safety certificate using artificial neural network. It also provides information, notification and generate report in real time.
2021 7th International Conference on Computer and Communications (ICCC)
In recent years, many modifications have been done to combat the weaknesses of the Vigenè re Ciph... more In recent years, many modifications have been done to combat the weaknesses of the Vigenè re Cipher Algorithm. Several studies have been carried out to rectify the flaw of the algorithm's repeating key nature by increasing the key length equal to that of the plain text. However, some characters cannot be encrypted due to the limited set of characters in the key. This paper modified the algorithm's key generation process using a Pseudo-Random Number Generator to improve the algorithm's security and expanded the table of characters to up to 190 characters. The results show that based on Monobit examination and frequency analysis, the repeating nature of the key is nonexistent, and the generated key can be used to encrypt a larger set of characters. The ciphertext has a low IC value of 0.030, which is similar to a random string and polyalphabetic cipher with an IC value of 0.038 but not equal to a monoalphabetic cipher with an IC value of 0.065. Results show that the modified version of the algorithm performs better than some of the recent studies conducted on it