IJCATR Volume 3 Issue 1

Detecting and Preventing Data Overloading Difficulty using Concept Hierarchies

Vijayakumar R Rajasekar G Raja Rajeswari B Raja S
10.7753/IJCATR0301.1008
keywords : Data mining, MeSH, Edge cut algorithm, concept hierarchy, Query results

PDF
Search queries on large databases, often return a large number of results, only a small subset of which is relevant to the user. When the user want to search the result for a particular query he or she find lot of difficulties when query results are large in size. To overcome the searching and navigation difficulty the following contributions are made. First, design very good user interface to search the query using front end tools like ASP.NET and it will fetch the result from database like SQL SERVER 2005. Second, Query results are organized into a tree format using tree control. Third, Ranking concept is used to display the concepts in order based on more number of times that concept is accessed. Fourth, Edge cut algorithm is used to display the query result mostly related to the user expected results in tree format. The advantage of this proposed work is minimizing navigation cost, provided good user interface to search the query and time consuming is very less. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem.
@artical{v312014ijcatr03011008,
Title = "Detecting and Preventing Data Overloading Difficulty using Concept Hierarchies",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "3",
Issue ="1",
Pages ="1 - 87",
Year = "2014",
Authors ="Vijayakumar R Rajasekar G Raja Rajeswari B Raja S"}
  • null