Swati Abhang - Academia.edu (original) (raw)

Papers by Swati Abhang

—In field of image processing and analysis Content based image retrieval is a very important prob... more —In field of image processing and analysis Content based image retrieval is a very important problem as there is rapid growth in storing and capturing multimedia data with digital devices. Although extensive studies, conducted and image finding is desired from multimedia databases and it is very challenging and open issue. This paper provides an review of evolutionary algorithms in in content based image retrieval (CBIR). Genetic algorithm is a branch of evolutionary algorithms which makes retrieval process more speedy do user can find their results from database as bettr as traditional ways. The paper covers the current achievements in relevance feedback, interactive genetic algorithm, neural network in CBIR, various relevance feedback techniques and applications of CBIR.

Association rule discovery from large databases is one of the tedious tasks in data mining. Most ... more Association rule discovery from large databases is one of the tedious tasks in data mining. Most of the previous studies on mining association rules are on mining intratransaction associations, i.e., the associations among items within the same transaction where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, etc. Mining intertransaction associations has more challenges on efficient processing than mining intratransaction associations because the number of potential association rules becomes extremely large after the boundary of transactions is broken. In this paper, we introduce the notion of intertransaction association rule mining given by algorithms such as EH-Apriori and FITI. FTTI generates many unnecessary combinations of items because the set of extended items is much larger than the set of items. Thus, In order to provide efficient solution we propose an approach of group-based intertransaction association rule mining, where this group of transactions are following certain constraints. This proposed solution will help in analyzing the predictions on stock market data.

… Journal of Computer …, 2011

This paper presents a heuristic evaluation method for online documentation to identify specific u... more This paper presents a heuristic evaluation method for online documentation to identify specific usability problems, which are observed with such documentation. We have used qualitative indicators for all heuristics, which are summed up to provide a usability index (with base 100). This index quantifies the goodness of online documentation under consideration. We have considered both types of online documents -online tutorial and online help. A tremendous increase in volume and contents of online documentation make its usability extremely vital for helping users in efficient usage and learning. The heuristic evaluation has been performed by three different usability evaluators for two more online documents to ensure the reliability of heuristics proposed in this paper. The specialized set of heuristics and the objectively defined usability indicators are found more reliable in identifying related usability problems. The usability index calculated is useful for comparison of quality of online documents. A tool is implemented which calculates the usability index and provides the analytical graphical output to the users so that they will know the comparative details about usability of the online documents.

IJCA Proceedings on …, 2012

Grid computing solves larger scale applications by coordinating and sharing computational power, ... more Grid computing solves larger scale applications by coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations by providing high performance computing platform with the goal of providing users with access to the resources they need, even when they need. Grids provide remote access to IT assets, and aggregate processing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. Scheduling onto the Grid is NP complete, so there is no best scheduling algorithm for all grid computing systems. The basic grid model generally composed of a number of hosts, each composed of several computational resources, which may be homogeneous or heterogeneous. In this article we have discussed all possible job scheduling algorithm in brief and lastly provided comparison for all.

Grid computing solves larger scale applications by coordinating and sharing computational power, ... more Grid computing solves larger scale applications by coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations by providing high performance computing platform with the goal of providing users with access to the resources they need, even when they need. Grids provide remote access to IT assets, and aggregate processing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. Scheduling onto the Grid is NP complete, so there is no best scheduling algorithm for all grid computing systems. The basic grid model generally composed of a number of hosts, each composed of several computational resources, which may be homogeneous or heterogeneous. In this article we have discussed all possible job scheduling algorithm in brief and lastly provided comparison for all.

—In field of image processing and analysis Content based image retrieval is a very important prob... more —In field of image processing and analysis Content based image retrieval is a very important problem as there is rapid growth in storing and capturing multimedia data with digital devices. Although extensive studies, conducted and image finding is desired from multimedia databases and it is very challenging and open issue. This paper provides an review of evolutionary algorithms in in content based image retrieval (CBIR). Genetic algorithm is a branch of evolutionary algorithms which makes retrieval process more speedy do user can find their results from database as bettr as traditional ways. The paper covers the current achievements in relevance feedback, interactive genetic algorithm, neural network in CBIR, various relevance feedback techniques and applications of CBIR.

Association rule discovery from large databases is one of the tedious tasks in data mining. Most ... more Association rule discovery from large databases is one of the tedious tasks in data mining. Most of the previous studies on mining association rules are on mining intratransaction associations, i.e., the associations among items within the same transaction where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, etc. Mining intertransaction associations has more challenges on efficient processing than mining intratransaction associations because the number of potential association rules becomes extremely large after the boundary of transactions is broken. In this paper, we introduce the notion of intertransaction association rule mining given by algorithms such as EH-Apriori and FITI. FTTI generates many unnecessary combinations of items because the set of extended items is much larger than the set of items. Thus, In order to provide efficient solution we propose an approach of group-based intertransaction association rule mining, where this group of transactions are following certain constraints. This proposed solution will help in analyzing the predictions on stock market data.

… Journal of Computer …, 2011

This paper presents a heuristic evaluation method for online documentation to identify specific u... more This paper presents a heuristic evaluation method for online documentation to identify specific usability problems, which are observed with such documentation. We have used qualitative indicators for all heuristics, which are summed up to provide a usability index (with base 100). This index quantifies the goodness of online documentation under consideration. We have considered both types of online documents -online tutorial and online help. A tremendous increase in volume and contents of online documentation make its usability extremely vital for helping users in efficient usage and learning. The heuristic evaluation has been performed by three different usability evaluators for two more online documents to ensure the reliability of heuristics proposed in this paper. The specialized set of heuristics and the objectively defined usability indicators are found more reliable in identifying related usability problems. The usability index calculated is useful for comparison of quality of online documents. A tool is implemented which calculates the usability index and provides the analytical graphical output to the users so that they will know the comparative details about usability of the online documents.

IJCA Proceedings on …, 2012

Grid computing solves larger scale applications by coordinating and sharing computational power, ... more Grid computing solves larger scale applications by coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations by providing high performance computing platform with the goal of providing users with access to the resources they need, even when they need. Grids provide remote access to IT assets, and aggregate processing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. Scheduling onto the Grid is NP complete, so there is no best scheduling algorithm for all grid computing systems. The basic grid model generally composed of a number of hosts, each composed of several computational resources, which may be homogeneous or heterogeneous. In this article we have discussed all possible job scheduling algorithm in brief and lastly provided comparison for all.

Grid computing solves larger scale applications by coordinating and sharing computational power, ... more Grid computing solves larger scale applications by coordinating and sharing computational power, data storage and network resources across dynamic and geographically dispersed organizations by providing high performance computing platform with the goal of providing users with access to the resources they need, even when they need. Grids provide remote access to IT assets, and aggregate processing power. The goal of scheduling is to achieve highest possible system throughput and to match the application need with the available computing resources. Scheduling onto the Grid is NP complete, so there is no best scheduling algorithm for all grid computing systems. The basic grid model generally composed of a number of hosts, each composed of several computational resources, which may be homogeneous or heterogeneous. In this article we have discussed all possible job scheduling algorithm in brief and lastly provided comparison for all.