The keyword searching mechanism is traditionally used for information retrieval from Web based systems. However, this system fails to meet the requirements in Web searching of the expert knowledge base based on the popular semantic systems. Semantic search of E-learning documents based on ontology is increasingly adopted in information retrieval systems. Ontology based system simplifies the task of finding correct information on the Web by building a search system based on the meaning of keyword instead of the keyword itself. The major function of the ontology based system is the development of specification of conceptualization which enhances the connection between the information present in the Web pages with that of the background knowledge.The semantic gap existing between the keyword found in documents and those in query can be matched suitably using Ontology based system. This paper provides a detailed account of the semantic search of E-learning documents using ontology based system by making comparison between various ontology systems. Based on this comparison, this survey attempts to identify the possible directions for future research.
Performance Evaluation of Query Processing Techniques in Information Retrievalidescitation
The first element of the search process is the query.
The user query being on an average restricted to two or three
keywords makes the query ambiguous to the search engine.
Given the user query, the goal of an Information Retrieval
[IR] system is to retrieve information which might be useful
or relevant to the information need of the user. Hence, the
query processing plays an important role in IR system.
The query processing can be divided into four categories
i.e. query expansion, query optimization, query classification and
query parsing. In this paper an attempt is made to evaluate the
performance of query processing algorithms in each of the
category. The evaluation was based on dataset as specified by
Forum for Information Retrieval [FIRE15]. The criteria used
for evaluation are precision and relative recall. The analysis is
based on the importance of each step in query processing. The
experimental results show that the significance of each step
in query processing and also the relevance of web semantics
and spelling correction in the user query.
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGYcscpconf
A digital library is a type of information retrieval (IR) system. The existing information retrieval
methodologies generally have problems on keyword-searching. We proposed a model to solve
the problem by using concept-based approach (ontology) and metadata case base. This model
consists of identifying domain concepts in user’s query and applying expansion to them. The
system aims at contributing to an improved relevance of results retrieved from digital libraries
by proposing a conceptual query expansion for intelligent concept-based retrieval. We need to
import the concept of ontology, making use of its advantage of abundant semantics and
standard concept. Domain specific ontology can be used to improve information retrieval from
traditional level based on keyword to the lay based on knowledge (or concept) and change the
process of retrieval from traditional keyword matching to semantics matching. One approach is
query expansion techniques using domain ontology and the other would be introducing a case
based similarity measure for metadata information retrieval using Case Based Reasoning
(CBR) approach. Results show improvements over classic method, query expansion using
general purpose ontology and a number of other approaches.
Ontology Based Approach for Semantic Information Retrieval SystemIJTET Journal
Abstract—The Information retrieval system is taking an important role in current search engine which performs searching operation based on keywords which results in an enormous amount of data available to the user, from which user cannot figure out the essential and most important information. This limitation may be overcome by a new web architecture known as the semantic web which overcome the limitation of the keyword based search technique called the conceptual or the semantic search technique. Natural language processing technique is mostly implemented in a QA system for asking user’s questions and several steps are also followed for conversion of questions to the query form for retrieving an exact answer. In conceptual search, search engine interprets the meaning of the user’s query and the relation among the concepts that document contains with respect to a particular domain that produces specific answers instead of showing lists of answers. In this paper, we proposed the ontology based semantic information retrieval system and the Jena semantic web framework in which, the user enters an input query which is parsed by Standford Parser then the triplet extraction algorithm is used. For all input queries, the SPARQL query is formed and further, it is fired on the knowledge base (Ontology) which finds appropriate RDF triples in knowledge base and retrieve the relevant information using the Jena framework.
Semantic Information Retrieval Using Ontology in University Domain dannyijwest
Today’s conventional search engines hardly do provide the essential content relevant to the user’s search
query. This is because the context and semantics of the request made by the user is not analyzed to the full
extent. So here the need for a semantic web search arises. SWS is upcoming in the area of web search
which combines Natural Language Processing and Artificial Intelligence. The objective of the work done
here is to design, develop and implement a semantic search engine- SIEU(Semantic Information
Extraction in University Domain) confined to the university domain. SIEU uses ontology as a knowledge
base for the information retrieval process. It is not just a mere keyword search. It is one layer above what
Google or any other search engines retrieve by analyzing just the keywords. Here the query is analyzed
both syntactically and semantically. The developed system retrieves the web results more relevant to the
user query through keyword expansion. The results obtained here will be accurate enough to satisfy the
request made by the user. The level of accuracy will be enhanced since the query is analyzed semantically.
The system will be of great use to the developers and researchers who work on web. The Google results are
re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which
fetches more apt results for the user query.
SEMANTIC INFORMATION EXTRACTION IN UNIVERSITY DOMAINcscpconf
Today’s conventional search engines hardly do provide the essential content relevant to the
user’s search query. This is because the context and semantics of the request made by the user
is not analyzed to the full extent. So here the need for a semantic web search arises. SWS is
upcoming in the area of web search which combines Natural Language Processing and
Artificial Intelligence.
The objective of the work done here is to design, develop and implement a semantic search
engine- SIEU(Semantic Information Extraction in University Domain) confined to the
university domain. SIEU uses ontology as a knowledge base for the information retrieval
process. It is not just a mere keyword search. It is one layer above what Google or any other
search engines retrieve by analyzing just the keywords. Here the query is analyzed both
syntactically and semantically.
The developed system retrieves the web results more relevant to the user query through keyword
expansion. The results obtained here will be accurate enough to satisfy the request made by the
user. The level of accuracy will be enhanced since the query is analyzed semantically. The
system will be of great use to the developers and researchers who work on web. The Google results are re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which fetches more apt results for the user query
In this paper, we present three techniques for incorporating syntactic metadata in a textual retrieval system. The first technique involves just a syntactic analysis of the query and it generates a different weight for each term of the query, depending on its grammar category in the query phrase. These weights will be used for each term in the retrieval process. The second technique involves a storage optimization of the system's inverted index that is the inverse index will store only terms that are subjects or predicates in the document they appear in. Finally, the third technique builds a full syntactic index, meaning that for each term in the term collection, the inverse index stores besides the term-frequency and the inverse-document-frequency, also the grammar category of the term for each of its occurrences in a document.
Performance Evaluation of Query Processing Techniques in Information Retrievalidescitation
The first element of the search process is the query.
The user query being on an average restricted to two or three
keywords makes the query ambiguous to the search engine.
Given the user query, the goal of an Information Retrieval
[IR] system is to retrieve information which might be useful
or relevant to the information need of the user. Hence, the
query processing plays an important role in IR system.
The query processing can be divided into four categories
i.e. query expansion, query optimization, query classification and
query parsing. In this paper an attempt is made to evaluate the
performance of query processing algorithms in each of the
category. The evaluation was based on dataset as specified by
Forum for Information Retrieval [FIRE15]. The criteria used
for evaluation are precision and relative recall. The analysis is
based on the importance of each step in query processing. The
experimental results show that the significance of each step
in query processing and also the relevance of web semantics
and spelling correction in the user query.
INTELLIGENT INFORMATION RETRIEVAL WITHIN DIGITAL LIBRARY USING DOMAIN ONTOLOGYcscpconf
A digital library is a type of information retrieval (IR) system. The existing information retrieval
methodologies generally have problems on keyword-searching. We proposed a model to solve
the problem by using concept-based approach (ontology) and metadata case base. This model
consists of identifying domain concepts in user’s query and applying expansion to them. The
system aims at contributing to an improved relevance of results retrieved from digital libraries
by proposing a conceptual query expansion for intelligent concept-based retrieval. We need to
import the concept of ontology, making use of its advantage of abundant semantics and
standard concept. Domain specific ontology can be used to improve information retrieval from
traditional level based on keyword to the lay based on knowledge (or concept) and change the
process of retrieval from traditional keyword matching to semantics matching. One approach is
query expansion techniques using domain ontology and the other would be introducing a case
based similarity measure for metadata information retrieval using Case Based Reasoning
(CBR) approach. Results show improvements over classic method, query expansion using
general purpose ontology and a number of other approaches.
Ontology Based Approach for Semantic Information Retrieval SystemIJTET Journal
Abstract—The Information retrieval system is taking an important role in current search engine which performs searching operation based on keywords which results in an enormous amount of data available to the user, from which user cannot figure out the essential and most important information. This limitation may be overcome by a new web architecture known as the semantic web which overcome the limitation of the keyword based search technique called the conceptual or the semantic search technique. Natural language processing technique is mostly implemented in a QA system for asking user’s questions and several steps are also followed for conversion of questions to the query form for retrieving an exact answer. In conceptual search, search engine interprets the meaning of the user’s query and the relation among the concepts that document contains with respect to a particular domain that produces specific answers instead of showing lists of answers. In this paper, we proposed the ontology based semantic information retrieval system and the Jena semantic web framework in which, the user enters an input query which is parsed by Standford Parser then the triplet extraction algorithm is used. For all input queries, the SPARQL query is formed and further, it is fired on the knowledge base (Ontology) which finds appropriate RDF triples in knowledge base and retrieve the relevant information using the Jena framework.
Semantic Information Retrieval Using Ontology in University Domain dannyijwest
Today’s conventional search engines hardly do provide the essential content relevant to the user’s search
query. This is because the context and semantics of the request made by the user is not analyzed to the full
extent. So here the need for a semantic web search arises. SWS is upcoming in the area of web search
which combines Natural Language Processing and Artificial Intelligence. The objective of the work done
here is to design, develop and implement a semantic search engine- SIEU(Semantic Information
Extraction in University Domain) confined to the university domain. SIEU uses ontology as a knowledge
base for the information retrieval process. It is not just a mere keyword search. It is one layer above what
Google or any other search engines retrieve by analyzing just the keywords. Here the query is analyzed
both syntactically and semantically. The developed system retrieves the web results more relevant to the
user query through keyword expansion. The results obtained here will be accurate enough to satisfy the
request made by the user. The level of accuracy will be enhanced since the query is analyzed semantically.
The system will be of great use to the developers and researchers who work on web. The Google results are
re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which
fetches more apt results for the user query.
SEMANTIC INFORMATION EXTRACTION IN UNIVERSITY DOMAINcscpconf
Today’s conventional search engines hardly do provide the essential content relevant to the
user’s search query. This is because the context and semantics of the request made by the user
is not analyzed to the full extent. So here the need for a semantic web search arises. SWS is
upcoming in the area of web search which combines Natural Language Processing and
Artificial Intelligence.
The objective of the work done here is to design, develop and implement a semantic search
engine- SIEU(Semantic Information Extraction in University Domain) confined to the
university domain. SIEU uses ontology as a knowledge base for the information retrieval
process. It is not just a mere keyword search. It is one layer above what Google or any other
search engines retrieve by analyzing just the keywords. Here the query is analyzed both
syntactically and semantically.
The developed system retrieves the web results more relevant to the user query through keyword
expansion. The results obtained here will be accurate enough to satisfy the request made by the
user. The level of accuracy will be enhanced since the query is analyzed semantically. The
system will be of great use to the developers and researchers who work on web. The Google results are re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which fetches more apt results for the user query
In this paper, we present three techniques for incorporating syntactic metadata in a textual retrieval system. The first technique involves just a syntactic analysis of the query and it generates a different weight for each term of the query, depending on its grammar category in the query phrase. These weights will be used for each term in the retrieval process. The second technique involves a storage optimization of the system's inverted index that is the inverse index will store only terms that are subjects or predicates in the document they appear in. Finally, the third technique builds a full syntactic index, meaning that for each term in the term collection, the inverse index stores besides the term-frequency and the inverse-document-frequency, also the grammar category of the term for each of its occurrences in a document.
WEB SEARCH ENGINE BASED SEMANTIC SIMILARITY MEASURE BETWEEN WORDS USING PATTE...cscpconf
Semantic Similarity measures plays an important role in information retrieval, natural language processing and various tasks on web such as relation extraction, community mining, document clustering, and automatic meta-data extraction. In this paper, we have proposed a Pattern Retrieval Algorithm [PRA] to compute the semantic similarity measure between the words by
combining both page count method and web snippets method. Four association measures are used to find semantic similarity between words in page count method using web search engines. We use a Sequential Minimal Optimization (SMO) support vector machines (SVM) to find the optimal combination of page counts-based similarity scores and top-ranking patterns from the web snippets method. The SVM is trained to classify synonymous word-pairs and nonsynonymous word-pairs. The proposed approach aims to improve the Correlation values,
Precision, Recall, and F-measures, compared to the existing methods. The proposed algorithm outperforms by 89.8 % of correlation value.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Recommendation generation by integrating sequential pattern mining and semanticseSAT Journals
Abstract As the Internet usage keeps increasing, the number of web sites and hence the number of web pages also keeps increasing. A recommendation system can be used to provide personalized web service by suggesting the pages that are likely to be accessed in future. Most of the recommendation systems are based on association rule mining or based on keywords. Using the association rule mining the prediction rate is less as it doesn’t take into account the order of access of the web pages by the users. The recommendation systems that are key-word based provides lesser relevant results. This paper proposes a recommendation system that uses the advantages of sequential pattern mining and semantics over the association rule mining and keyword based systems respectively. Keywords: Sequential Pattern Mining, Taxonomy, Apriori-All, CS-Mine, Semantic, Clustering
Application of hidden markov model in question answering systemsijcsa
By the increase of the volume of the saved information on web, Question Answering (QA) systems have been very important for Information Retrieval (IR). QA systems are a specialized form of information retrieval. Given a collection of documents, a Question Answering system attempts to retrieve correct answers to questions posed in natural language. Web QA system is a sample of QA systems that in this system answers retrieval from web environment doing. In contrast to the databases, the saved information on web does not follow a distinct structure and are not generally defined. Web QA systems is the task of automatically answering a question posed in Natural Language Processing (NLP). NLP techniques are used in applications that make queries to databases, extract information from text, retrieve relevant documents from a collection, translate from one language to another, generate text responses, or recognize spoken words converting them into text. To find the needed information on a mass of the non-structured information we have to use techniques in which the accuracy and retrieval factors are implemented well. In this paper in order to well IR in web environment, The QA system in designed and also implemented based on the Hidden Markov Model (HMM)
`A Survey on approaches of Web Mining in Varied Areasinventionjournals
There has been lot of research in recent years for efficient web searching. Several papers have proposed algorithm for user feedback sessions, to evaluate the performance of inferring user search goals. When the information is retrieved, user clicks on a particular URL. Based on the click rate, ranking will be done automatically, clustering the feedback sessions. Web search engines have made enormous contributions to the web and society. They make finding information on the web quick and easy. However, they are far from optimal. A major deficiency of generic search engines is that they follow the ‘‘one size fits all’’ model and are not adaptable to individual users.
Building a recommendation system based on the job offers extracted from the w...IJECEIAES
Recruitment, or job search, is increasingly used throughout the world by a large population of users through various channels, such as websites, platforms, and professional networks. Given the large volume of information related to job descriptions and user profiles, it is complicated to appropriately match a user's profile with a job description, and vice versa. The job search approach has drawbacks since the job seeker needs to search a job offers in each recruitment platform, manage their accounts, and apply for the relevant job vacancies, which wastes considerable time and effort. The contribution of this research work is the construction of a recommendation system based on the job offers extracted from the web and on the e-portfolios of job seekers. After the extraction of the data, natural language processing is applied to structured data and is ready for filtering and analysis. The proposed system is a content-based system, it measures the degree of correspondence between the attributes of the e-portfolio with those of each job offer of the same list of competence specialties using the Euclidean distance, the result is classified with a decreasing way to display the most relevant to the least relevant job offers
NATURE: A TOOL RESULTING FROM THE UNION OF ARTIFICIAL INTELLIGENCE AND NATURA...ijaia
This paper presents the final results of the research project that aimed for the construction of a tool which
is aided by Artificial Intelligence through an Ontology with a model trained with Machine Learning, and is
aided by Natural Language Processing to support the semantic search of research projects of the Research
System of the University of Nariño. For the construction of NATURE, as this tool is called, a methodology
was used that includes the following stages: appropriation of knowledge, installation and configuration of
tools, libraries and technologies, collection, extraction and preparation of research projects, design and
development of the tool. The main results of the work were three: a) the complete construction of the
Ontology with classes, object properties (predicates), data properties (attributes) and individuals
(instances) in Protegé, SPARQL queries with Apache Jena Fuseki and the respective coding with
Owlready2 using Jupyter Notebook with Python within the virtual environment of anaconda; b) the
successful training of the model for which Machine Learning algorithms were used and specifically
Natural Language Processing algorithms such as: SpaCy, NLTK, Word2vec and Doc2vec, this was also
performed in Jupyter Notebook with Python within the virtual environment of anaconda and with
Elasticsearch; and c) the creation of NATURE by managing and unifying the queries for the Ontology and
for the Machine Learning model. The tests showed that NATURE was successful in all the searches that
were performed as its results were satisfactory
Extracting and Reducing the Semantic Information Content of Web Documents to ...ijsrd.com
Ranking and optimization of web service compositions represent challenging areas of research with significant implication for realization of the "Web of Services" vision. The semantic web, where the semantics information is indicated using machine-process able language such as the Web Ontology Language (OWL) "Semantic web service" use formal semantic description of web service functionality and enable automated reasoning over web service compositions. These semantic web services can then be automatically discovered, composed into more complex services, and executed. Automating web service composition through the use of semantic technologies calculating the semantic similarities between outputs and inputs of connected constituent services, and aggregate these values into a measure of semantics quality for the composition. It propose a novel and extensible model balancing the new dimensions of semantic quality ( as a functional quality metric) with QoS metric, and using them together as a ranking and optimization criteria. It also demonstrates the utility of Genetic Algorithms to allow optimization within the context of a large number of services foreseen by the "Web of Service" vision. To reduce the semantics of the web documents then to support semantic document retrieval by using Network Ontology Language (NOL) and to improve QoS as a ranking and optimization.
Optimization of Search Results with Duplicate Page Elimination using Usage DataIDES Editor
The performance and scalability of search engines
are greatly affected by the presence of enormous amount of
duplicate data on the World Wide Web. The flooded search
results containing a large number of identical or near identical
web pages affect the search efficiency and seek time of the users
to find the desired information within the search results. When
navigating through the results, the only information left behind
by the users is the trace through the pages they accessed. This
data is recorded in the query log files and usually referred to
as Web Usage Data. In this paper, a novel technique for
optimizing search efficiency by removing duplicate data from
search results is being proposed, which utilizes the usage data
stored in the query logs. The duplicate data detection is
performed by the proposed Duplicate Data Detection (D3)
algorithm, which works offline on the basis of favored user
queries found by pre-mining the logs with query clustering.
The proposed result optimization technique is supposed to
enhance the search engine efficiency and effectiveness to a large
scale.
BSI: BLOOM FILTER-BASED SEMANTIC INDEXING FOR UNSTRUCTURED P2P NETWORKSijp2p
Resource management and search is very important yet challenging in large-scale distributed systems like
P2Pnetworks. Most existing P2P systems rely on indexing to efficiently route queries over the network.
However, searches based on such indices face two key issues. First, majority of existing search schemes
often rely on simply keyword based indices that can only support exact string based matches without taking
into account the meaning of words. Second it is difficult, if not impossible, to devise query based indexing
schemes that can represent all possible concept combinations without resulting in exponential index sizes.
To address these problems, we present BSI, a novel P2P indexing and query routing strategy to support
semantic based content searches. The BSI indexing structure captures the semantic content of documents
using a reference ontology. Our indexing scheme can efficiently handle multi-concept queries by
maintaining summary level information for each individual concept and concept combinations using a
novel space-efficient Two-level Semantic Bloom Filter(TSBF) data structure. By using TSBFs to represent
a large document and query base, BSI significantly reduces the communication cost and storage cost of
indices. Furthermore, We devise a low-overhead mechanism to allow peers to dynamically estimate the
relevance strength of a peer for multi-concept queries with high accuracy solely based on TSBFs. We also
propose a routing index compression mechanism to observe peers’ dynamic storage limitations with
minimal loss of information by exploiting a reference ontology structure. Based on the proposed index
structure, we design a novel query routing algorithm that exploits semantic based information to route
queries to semantically relevant peers. Performance evaluation demonstrates that our proposed approach
can improve the search recall of unstructured P2P systems up to 383.71% while keeping the
communication cost at a low level compared to state-of-art search mechanism OSQR [7].
BSI: BLOOM FILTER-BASED SEMANTIC INDEXING FOR UNSTRUCTURED P2P NETWORKSijp2p
Resource management and search is very important yet challenging in large-scale distributed systems like
P2Pnetworks. Most existing P2P systems rely on indexing to efficiently route queries over the network.
However, searches based on such indices face two key issues. First, majority of existing search schemes
often rely on simply keyword based indices that can only support exact string based matches without taking
into account the meaning of words. Second it is difficult, if not impossible, to devise query based indexing
schemes that can represent all possible concept combinations without resulting in exponential index sizes.
To address these problems, we present BSI, a novel P2P indexing and query routing strategy to support
semantic based content searches. The BSI indexing structure captures the semantic content of documents
using a reference ontology. Our indexing scheme can efficiently handle multi-concept queries by
maintaining summary level information for each individual concept and concept combinations using a
novel space-efficient Two-level Semantic Bloom Filter(TSBF) data structure. By using TSBFs to represent
a large document and query base, BSI significantly reduces the communication cost and storage cost of
indices. Furthermore, We devise a low-overhead mechanism to allow peers to dynamically estimate the
relevance strength of a peer for multi-concept queries with high accuracy solely based on TSBFs. We also
propose a routing index compression mechanism to observe peers’ dynamic storage limitations with
minimal loss of information by exploiting a reference ontology structure. Based on the proposed index
structure, we design a novel query routing algorithm that exploits semantic based information to route
queries to semantically relevant peers. Performance evaluation demonstrates that our proposed approach
can improve the search recall of unstructured P2P systems up to 383.71% while keeping the
communication cost at a low level compared to state-of-art search mechanism OSQR [7].
BSI: BLOOM FILTER-BASED SEMANTIC INDEXING FOR UNSTRUCTURED P2P NETWORKSijp2p
Resource management and search is very important yet challenging in large-scale distributed systems like
P2Pnetworks. Most existing P2P systems rely on indexing to efficiently route queries over the network.
However, searches based on such indices face two key issues. First, majority of existing search schemes
often rely on simply keyword based indices that can only support exact string based matches without taking
into account the meaning of words. Second it is difficult, if not impossible, to devise query based indexing
schemes that can represent all possible concept combinations without resulting in exponential index sizes.
To address these problems, we present BSI, a novel P2P indexing and query routing strategy to support
semantic based content searches. The BSI indexing structure captures the semantic content of documents
using a reference ontology. Our indexing scheme can efficiently handle multi-concept queries by
maintaining summary level information for each individual concept and concept combinations using a
novel space-efficient Two-level Semantic Bloom Filter(TSBF) data structure. By using TSBFs to represent
a large document and query base, BSI significantly reduces the communication cost and storage cost of
indices. Furthermore, We devise a low-overhead mechanism to allow peers to dynamically estimate the
relevance strength of a peer for multi-concept queries with high accuracy solely based on TSBFs. We also
propose a routing index compression mechanism to observe peers’ dynamic storage limitations with
minimal loss of information by exploiting a reference ontology structure. Based on the proposed index
structure, we design a novel query routing algorithm that exploits semantic based information to route
queries to semantically relevant peers. Performance evaluation demonstrates that our proposed approach
can improve the search recall of unstructured P2P systems up to 383.71% while keeping the
communication cost at a low level compared to state-of-art search mechanism OSQR [7].
A Survey of Ontology-based Information Extraction for Social Media Content An...ijcnes
The amount of information generated in the Web has grown enormously over the years. This information is significant to individuals, businesses and organizations. If analyzed, understood and utilized, it will provide a valuable insight to its stakeholders. However, many of these information are semi-structured or unstructured which makes it difficult to draw in-depth understanding of the implications behind those information. This is where Ontology-based Information Extraction (OBIE) and social media content analysis come into play. OBIE has now become a popular way to extract information coming from machine-readable sources. This paper presents a survey of OBIE, Ontology languages and tools and the process to build an ontology model and framework. The author made a comparison of two ontology building frameworks and identified which framework is complete.
Economic Growth of Information Technology (It) Industry on the Indian Economyijcnes
Information Technology (IT) is an important emerging sector of the Indian Economy. IT in India is an industry comprising of two noteworthy segments IT administrations and business process outsourcing (BPO).The segment has expanded its commitment to Indias GDP from 1.2% in 1998 to 9.3% in 2015. According to NASSCOM, the segment amassed incomes of US$147 billion out of 2015, with send out income remaining at US$99 billion and household income at US$48 billion, developing by more than 13%.Indias present Prime Minister Narendra Modi has begun a venture called �DIGITAL INDIA i.e., Computerized India to help secure IT a position both inside and outside of India. The IT sector has served as a fertile ground for the growth of a new entrepreneurial class with innovative corporate practices and has been instrumental in reversing the brain drain, raising Indias brand equity and attracting foreign direct investment (FDI) leading to other associated benefits. The Size of this sector has increased at a tremendous rate of 35% per year during the last 10 years. This Paper examines the India�s growth in IT industry and also studied the impact of IT on the Indian Economy.
More Related Content
Similar to Semantic Search of E-Learning Documents Using Ontology Based System
WEB SEARCH ENGINE BASED SEMANTIC SIMILARITY MEASURE BETWEEN WORDS USING PATTE...cscpconf
Semantic Similarity measures plays an important role in information retrieval, natural language processing and various tasks on web such as relation extraction, community mining, document clustering, and automatic meta-data extraction. In this paper, we have proposed a Pattern Retrieval Algorithm [PRA] to compute the semantic similarity measure between the words by
combining both page count method and web snippets method. Four association measures are used to find semantic similarity between words in page count method using web search engines. We use a Sequential Minimal Optimization (SMO) support vector machines (SVM) to find the optimal combination of page counts-based similarity scores and top-ranking patterns from the web snippets method. The SVM is trained to classify synonymous word-pairs and nonsynonymous word-pairs. The proposed approach aims to improve the Correlation values,
Precision, Recall, and F-measures, compared to the existing methods. The proposed algorithm outperforms by 89.8 % of correlation value.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Recommendation generation by integrating sequential pattern mining and semanticseSAT Journals
Abstract As the Internet usage keeps increasing, the number of web sites and hence the number of web pages also keeps increasing. A recommendation system can be used to provide personalized web service by suggesting the pages that are likely to be accessed in future. Most of the recommendation systems are based on association rule mining or based on keywords. Using the association rule mining the prediction rate is less as it doesn’t take into account the order of access of the web pages by the users. The recommendation systems that are key-word based provides lesser relevant results. This paper proposes a recommendation system that uses the advantages of sequential pattern mining and semantics over the association rule mining and keyword based systems respectively. Keywords: Sequential Pattern Mining, Taxonomy, Apriori-All, CS-Mine, Semantic, Clustering
Application of hidden markov model in question answering systemsijcsa
By the increase of the volume of the saved information on web, Question Answering (QA) systems have been very important for Information Retrieval (IR). QA systems are a specialized form of information retrieval. Given a collection of documents, a Question Answering system attempts to retrieve correct answers to questions posed in natural language. Web QA system is a sample of QA systems that in this system answers retrieval from web environment doing. In contrast to the databases, the saved information on web does not follow a distinct structure and are not generally defined. Web QA systems is the task of automatically answering a question posed in Natural Language Processing (NLP). NLP techniques are used in applications that make queries to databases, extract information from text, retrieve relevant documents from a collection, translate from one language to another, generate text responses, or recognize spoken words converting them into text. To find the needed information on a mass of the non-structured information we have to use techniques in which the accuracy and retrieval factors are implemented well. In this paper in order to well IR in web environment, The QA system in designed and also implemented based on the Hidden Markov Model (HMM)
`A Survey on approaches of Web Mining in Varied Areasinventionjournals
There has been lot of research in recent years for efficient web searching. Several papers have proposed algorithm for user feedback sessions, to evaluate the performance of inferring user search goals. When the information is retrieved, user clicks on a particular URL. Based on the click rate, ranking will be done automatically, clustering the feedback sessions. Web search engines have made enormous contributions to the web and society. They make finding information on the web quick and easy. However, they are far from optimal. A major deficiency of generic search engines is that they follow the ‘‘one size fits all’’ model and are not adaptable to individual users.
Building a recommendation system based on the job offers extracted from the w...IJECEIAES
Recruitment, or job search, is increasingly used throughout the world by a large population of users through various channels, such as websites, platforms, and professional networks. Given the large volume of information related to job descriptions and user profiles, it is complicated to appropriately match a user's profile with a job description, and vice versa. The job search approach has drawbacks since the job seeker needs to search a job offers in each recruitment platform, manage their accounts, and apply for the relevant job vacancies, which wastes considerable time and effort. The contribution of this research work is the construction of a recommendation system based on the job offers extracted from the web and on the e-portfolios of job seekers. After the extraction of the data, natural language processing is applied to structured data and is ready for filtering and analysis. The proposed system is a content-based system, it measures the degree of correspondence between the attributes of the e-portfolio with those of each job offer of the same list of competence specialties using the Euclidean distance, the result is classified with a decreasing way to display the most relevant to the least relevant job offers
NATURE: A TOOL RESULTING FROM THE UNION OF ARTIFICIAL INTELLIGENCE AND NATURA...ijaia
This paper presents the final results of the research project that aimed for the construction of a tool which
is aided by Artificial Intelligence through an Ontology with a model trained with Machine Learning, and is
aided by Natural Language Processing to support the semantic search of research projects of the Research
System of the University of Nariño. For the construction of NATURE, as this tool is called, a methodology
was used that includes the following stages: appropriation of knowledge, installation and configuration of
tools, libraries and technologies, collection, extraction and preparation of research projects, design and
development of the tool. The main results of the work were three: a) the complete construction of the
Ontology with classes, object properties (predicates), data properties (attributes) and individuals
(instances) in Protegé, SPARQL queries with Apache Jena Fuseki and the respective coding with
Owlready2 using Jupyter Notebook with Python within the virtual environment of anaconda; b) the
successful training of the model for which Machine Learning algorithms were used and specifically
Natural Language Processing algorithms such as: SpaCy, NLTK, Word2vec and Doc2vec, this was also
performed in Jupyter Notebook with Python within the virtual environment of anaconda and with
Elasticsearch; and c) the creation of NATURE by managing and unifying the queries for the Ontology and
for the Machine Learning model. The tests showed that NATURE was successful in all the searches that
were performed as its results were satisfactory
Extracting and Reducing the Semantic Information Content of Web Documents to ...ijsrd.com
Ranking and optimization of web service compositions represent challenging areas of research with significant implication for realization of the "Web of Services" vision. The semantic web, where the semantics information is indicated using machine-process able language such as the Web Ontology Language (OWL) "Semantic web service" use formal semantic description of web service functionality and enable automated reasoning over web service compositions. These semantic web services can then be automatically discovered, composed into more complex services, and executed. Automating web service composition through the use of semantic technologies calculating the semantic similarities between outputs and inputs of connected constituent services, and aggregate these values into a measure of semantics quality for the composition. It propose a novel and extensible model balancing the new dimensions of semantic quality ( as a functional quality metric) with QoS metric, and using them together as a ranking and optimization criteria. It also demonstrates the utility of Genetic Algorithms to allow optimization within the context of a large number of services foreseen by the "Web of Service" vision. To reduce the semantics of the web documents then to support semantic document retrieval by using Network Ontology Language (NOL) and to improve QoS as a ranking and optimization.
Optimization of Search Results with Duplicate Page Elimination using Usage DataIDES Editor
The performance and scalability of search engines
are greatly affected by the presence of enormous amount of
duplicate data on the World Wide Web. The flooded search
results containing a large number of identical or near identical
web pages affect the search efficiency and seek time of the users
to find the desired information within the search results. When
navigating through the results, the only information left behind
by the users is the trace through the pages they accessed. This
data is recorded in the query log files and usually referred to
as Web Usage Data. In this paper, a novel technique for
optimizing search efficiency by removing duplicate data from
search results is being proposed, which utilizes the usage data
stored in the query logs. The duplicate data detection is
performed by the proposed Duplicate Data Detection (D3)
algorithm, which works offline on the basis of favored user
queries found by pre-mining the logs with query clustering.
The proposed result optimization technique is supposed to
enhance the search engine efficiency and effectiveness to a large
scale.
BSI: BLOOM FILTER-BASED SEMANTIC INDEXING FOR UNSTRUCTURED P2P NETWORKSijp2p
Resource management and search is very important yet challenging in large-scale distributed systems like
P2Pnetworks. Most existing P2P systems rely on indexing to efficiently route queries over the network.
However, searches based on such indices face two key issues. First, majority of existing search schemes
often rely on simply keyword based indices that can only support exact string based matches without taking
into account the meaning of words. Second it is difficult, if not impossible, to devise query based indexing
schemes that can represent all possible concept combinations without resulting in exponential index sizes.
To address these problems, we present BSI, a novel P2P indexing and query routing strategy to support
semantic based content searches. The BSI indexing structure captures the semantic content of documents
using a reference ontology. Our indexing scheme can efficiently handle multi-concept queries by
maintaining summary level information for each individual concept and concept combinations using a
novel space-efficient Two-level Semantic Bloom Filter(TSBF) data structure. By using TSBFs to represent
a large document and query base, BSI significantly reduces the communication cost and storage cost of
indices. Furthermore, We devise a low-overhead mechanism to allow peers to dynamically estimate the
relevance strength of a peer for multi-concept queries with high accuracy solely based on TSBFs. We also
propose a routing index compression mechanism to observe peers’ dynamic storage limitations with
minimal loss of information by exploiting a reference ontology structure. Based on the proposed index
structure, we design a novel query routing algorithm that exploits semantic based information to route
queries to semantically relevant peers. Performance evaluation demonstrates that our proposed approach
can improve the search recall of unstructured P2P systems up to 383.71% while keeping the
communication cost at a low level compared to state-of-art search mechanism OSQR [7].
BSI: BLOOM FILTER-BASED SEMANTIC INDEXING FOR UNSTRUCTURED P2P NETWORKSijp2p
Resource management and search is very important yet challenging in large-scale distributed systems like
P2Pnetworks. Most existing P2P systems rely on indexing to efficiently route queries over the network.
However, searches based on such indices face two key issues. First, majority of existing search schemes
often rely on simply keyword based indices that can only support exact string based matches without taking
into account the meaning of words. Second it is difficult, if not impossible, to devise query based indexing
schemes that can represent all possible concept combinations without resulting in exponential index sizes.
To address these problems, we present BSI, a novel P2P indexing and query routing strategy to support
semantic based content searches. The BSI indexing structure captures the semantic content of documents
using a reference ontology. Our indexing scheme can efficiently handle multi-concept queries by
maintaining summary level information for each individual concept and concept combinations using a
novel space-efficient Two-level Semantic Bloom Filter(TSBF) data structure. By using TSBFs to represent
a large document and query base, BSI significantly reduces the communication cost and storage cost of
indices. Furthermore, We devise a low-overhead mechanism to allow peers to dynamically estimate the
relevance strength of a peer for multi-concept queries with high accuracy solely based on TSBFs. We also
propose a routing index compression mechanism to observe peers’ dynamic storage limitations with
minimal loss of information by exploiting a reference ontology structure. Based on the proposed index
structure, we design a novel query routing algorithm that exploits semantic based information to route
queries to semantically relevant peers. Performance evaluation demonstrates that our proposed approach
can improve the search recall of unstructured P2P systems up to 383.71% while keeping the
communication cost at a low level compared to state-of-art search mechanism OSQR [7].
BSI: BLOOM FILTER-BASED SEMANTIC INDEXING FOR UNSTRUCTURED P2P NETWORKSijp2p
Resource management and search is very important yet challenging in large-scale distributed systems like
P2Pnetworks. Most existing P2P systems rely on indexing to efficiently route queries over the network.
However, searches based on such indices face two key issues. First, majority of existing search schemes
often rely on simply keyword based indices that can only support exact string based matches without taking
into account the meaning of words. Second it is difficult, if not impossible, to devise query based indexing
schemes that can represent all possible concept combinations without resulting in exponential index sizes.
To address these problems, we present BSI, a novel P2P indexing and query routing strategy to support
semantic based content searches. The BSI indexing structure captures the semantic content of documents
using a reference ontology. Our indexing scheme can efficiently handle multi-concept queries by
maintaining summary level information for each individual concept and concept combinations using a
novel space-efficient Two-level Semantic Bloom Filter(TSBF) data structure. By using TSBFs to represent
a large document and query base, BSI significantly reduces the communication cost and storage cost of
indices. Furthermore, We devise a low-overhead mechanism to allow peers to dynamically estimate the
relevance strength of a peer for multi-concept queries with high accuracy solely based on TSBFs. We also
propose a routing index compression mechanism to observe peers’ dynamic storage limitations with
minimal loss of information by exploiting a reference ontology structure. Based on the proposed index
structure, we design a novel query routing algorithm that exploits semantic based information to route
queries to semantically relevant peers. Performance evaluation demonstrates that our proposed approach
can improve the search recall of unstructured P2P systems up to 383.71% while keeping the
communication cost at a low level compared to state-of-art search mechanism OSQR [7].
Similar to Semantic Search of E-Learning Documents Using Ontology Based System (20)
A Survey of Ontology-based Information Extraction for Social Media Content An...ijcnes
The amount of information generated in the Web has grown enormously over the years. This information is significant to individuals, businesses and organizations. If analyzed, understood and utilized, it will provide a valuable insight to its stakeholders. However, many of these information are semi-structured or unstructured which makes it difficult to draw in-depth understanding of the implications behind those information. This is where Ontology-based Information Extraction (OBIE) and social media content analysis come into play. OBIE has now become a popular way to extract information coming from machine-readable sources. This paper presents a survey of OBIE, Ontology languages and tools and the process to build an ontology model and framework. The author made a comparison of two ontology building frameworks and identified which framework is complete.
Economic Growth of Information Technology (It) Industry on the Indian Economyijcnes
Information Technology (IT) is an important emerging sector of the Indian Economy. IT in India is an industry comprising of two noteworthy segments IT administrations and business process outsourcing (BPO).The segment has expanded its commitment to Indias GDP from 1.2% in 1998 to 9.3% in 2015. According to NASSCOM, the segment amassed incomes of US$147 billion out of 2015, with send out income remaining at US$99 billion and household income at US$48 billion, developing by more than 13%.Indias present Prime Minister Narendra Modi has begun a venture called �DIGITAL INDIA i.e., Computerized India to help secure IT a position both inside and outside of India. The IT sector has served as a fertile ground for the growth of a new entrepreneurial class with innovative corporate practices and has been instrumental in reversing the brain drain, raising Indias brand equity and attracting foreign direct investment (FDI) leading to other associated benefits. The Size of this sector has increased at a tremendous rate of 35% per year during the last 10 years. This Paper examines the India�s growth in IT industry and also studied the impact of IT on the Indian Economy.
An analysis of Mobile Learning Implementation in Shinas College of Technology...ijcnes
In the past decade, technology has grown exponentially, especially the speed of the Internet and mobile technology have reached its peak it seems. This technology advancement also gives its impact to all the areas especially in the education sector. Researchers have to be interested in investigating how these technologies can be exploited for educational purposes aiming to enhance learning experiences. Subsequently, this has prompt an exploration slant which is ordinarily alluded to as Mobile Learning (M-Learning) in which specialists endeavors have meant to disseminate fitting learning encounters to learners considering their own flexibility needs, the universal usage of portable advances and the accessibility of data whenever � anyplace. By and by, m-learning is still in its start and extraordinary endeavors should be done as such as to explore the potential outcomes of educational outlook change from the conventional on-estimate fits-all illuminating ways to deal with a versatile and customized discovering that can be circulated by means of portable creations. This paper, presents the suitability and need of mobile learning facility in Shinas College of Technology(SHCT) and also presents the framework for implementing m-learning in SHCT.
A Survey on the Security Issues of Software Defined Networking Tool in Cloud ...ijcnes
The Advent of the digital age has led to a rise in different types of data with every passing day. In fact, it is expected that half of the total data used around the world will be on the cloud nowadays. This complex data needs to be stored, processed and analyzed for information gaining that can be used for several organizations. Cloud computing provides an appropriate platform for Software Defined Networking (SDN) in communicating and computing requirements of the latter. It makes cloud-based networking a viable research field in the current scenario. However, several issues addressed and risk needs to be mitigated in the L2 cloud server. Virtual networks and cloud federation being considered in the network virtualization over L3 cloud router. This research work explores the existing research challenges and discusses open issues for the security in cloud computing and its uses in the relevant field by means of a comparative analysis of L2 server L3 router based on SDN tools. Also, an analysis of such issues are discussed and summarized. Finally, the best tool identified for the use cloud security.
We briefly discuss about the e-government which is about the finishing transactions between the government and the public through internet. First, we wrote about the three sectors of e-government which are between government and (government, citizens, business). Second, we wrote about benefits that users can get from using e-government. Third, we wrote about the challenges that e-government fac
Power Management in Micro grid Using Hybrid Energy Storage Systemijcnes
This paper proposed for power management in micro grid using a hybrid distributed generator based on photovoltaic, wind-driven PMDC and energy storage system is proposed. In this generator, the sources are together connected to the grid with the help of interleaved boost converter followed by an inverter. Thus, compared to earlier schemes, the proposed scheme has fewer power converters. FUZZY based MPPT controllers are also proposed for the new hybrid scheme to separately trigger the interleaved DC-DC converter and the inverter for tracking the maximum power from both the sources. The integrated operations of both the proposed controllers for different conditions are demonstrated through simulation with the help of MATLAB software
Holistic Forecasting of Onset of Diabetes through Data Mining Techniquesijcnes
Diabetes is one of the modern day diseases that poses serious threat for the affected and is ever challenging for physicians who are involved in its management and control.Type2 diabetes mellitus ranges in exponential rating day by day in its increase. Mere not being aware of the facts and causes that can lead to such state, unawareness about diabetic symptoms and late detection make diabetic condition unmanageable and is really a challenging task to be faced all victims. This paper suggests holistic measures and means by which any common man can get into it to check whether he / she is a would-be victim of Diabetes through simple checking of symptoms that may lead to Diabetic condition, analyses the factual causes of the aforesaid disease. This would certainly make a person to ensure for the locus-centric state of whether of being a diabetic or not. The problem of diagnosing the onset and incidence of Diabetes is addressed more with a data mining approach in mind. As the success of any data mining approach is solely dependant on the underlying dataset upon which learning is manifested and taken for, this paper inspects more on locating prima-facie symptoms of diabetes disorder. A sagacious insight of analyzing the actual causes of diabetes is set and hence a comprehensive set of data for diabetic condition is proposed here. Subjecting this data to data analysis through simple data mining techniques v.i.z., FP-Growth and Apriori would certainly model a holistic inference engine that could help a doctor to be more astute in confirming the diabetic condition of patients. Association rules are also being inducted based on both of these approaches. A heuristic computer aided diagnosis (CAD) system for diabetes can be built upon this
A Survey on Disease Prediction from Retinal Colour Fundus Images using Image ...ijcnes
The aim of this survey is to list the various disease predictions from retinal funds images and various methods used to detect the disease. This paper gives a detailed description about the various diseases predicted in retina by comparing retinal funds image structure. Till now, the prediction of various diseases such as diabetic retinopathy, cardiovascular disease and other eye problems had been predicted by using retinal funds images. Next, a comparative study of the various methods followed using image processing to find out the diseases from retinal funds images, is provided. The basic matrices observed to predict the diseases are optic disc,nerve cup and rim. To find the differences in the basic matrices, image processing techniques such as mask generation, colour normalization, edge detection, contrast enhancement are used. The datasets that are used for retinal image inputs are STARE, DRIVE, ONHSD, ARIA, IMAGERET. The survey at the end, discusses the future work for the possibilities of predicting gastreointestinal problems via retinal funds images.
Feature Extraction in Content based Image Retrievalijcnes
A technique for Content Based Image Retrieval (CBIR) for the generation of image content descriptor which exploiting the advantage of low complexity Order Dither Block Truncation Coding (ODBTC). The quantizer and bitmap image are the compressed form of image obtained from the ODBTC technique in encoding step. Decoding is not performed in this method. It has two image feature such as Color Co-occurrence Feature (CCF) and Bit Pattern Feature (BPF) for indexing the image. These features are directly obtained from ODBTC encoded data stream. By comparing with the BTC image retrieval system and other earlier method the experimental result show the proposed method is superior. ODBTC is suited for image compression and it is a simple and effective descriptor to index the image in CBIR system. Content-based image retrieval is a technique which is used to extract the images on the basis of their content such as texture, color, shape and spatial layout. In order to minimize this gap many concepts was introduced. Moreover, Images can be stored and extracted based on various features and one of the prominent feature is Texture.
Challenges and Mechanisms for Securing Data in Mobile Cloud Computingijcnes
Cloud computing enables users to utilize the services of computing resources. Now days computing resources in mobile applications are being delivered with cloud computing. As there is a growing need for new mobile applications, usage of cloud computing can not be overlooked. Cloud service providers offers the services for the data request in a remote server. Virtualization aspect of cloud computing in mobile applications felicitates better utilization of resources. The industry needs to address the foremost security risk in the underlying technology. The cloud computing environment in mobile applications aggravated with various security problems. This paper addresses challenges in securing data in cloud for mobile Cloud computing and few mechanisms to overcome.
Detection of Node Activity and Selfish & Malicious Behavioral Patterns using ...ijcnes
Mobile ad-hoc networks(MANETs) assume that mobile nodes voluntary cooperate in order to work properly. This cooperation is a cost-intensive activity and some nodes can refuse to cooperate, leading to a selfish node behaviour. Thus, the overall network performance could be seriously affected. The use of watchdogs is a well-known mechanism to detect selfish nodes. However, the detection process performed by watchdogs can fail, generating false positives and false negatives that can induce to wrong operations. Moreover, relying on local watchdogs alone can lead to poor performance when detecting selfish nodes, in term of precision and speed. This is especially important on networks with sporadic contacts, such as delay tolerant networks (DTNs), where sometimes watchdogs lack of enough time or information to detect the selfish nodes. Thus, We apply chord algorithm to identify behavior pattern of one shelf by two neighborhood nodes and themselves. Servers will finally categories nature of node.
Optimal Channel and Relay Assignment in Ofdmbased Multi-Relay Multi-Pair Two-...ijcnes
Efficient utilization of radio resources in wireless networks is crucial and has been investigated extensively. This letter considers a wireless relay network where multiple user pairs conduct bidirectional communications via multiple relays based on orthogonal frequency-division multiplexing (OFDM) transmission. The joint optimization of channel and relay assignment, including subcarrier pairing, subcarrier allocation as well as relay selection, for total throughput maximization is formulated as a combinatorial optimization problem. Using a graph theoretical approach, we solve the problem optimally in polynomial time by transforming it into a maximum weighted bipartite matching (MWBM) problem. Simulation studies are carried out to evaluate the network total throughput versus transmit power per node and the number of relay nodes
An Effective and Scalable AODV for Wireless Ad hoc Sensor Networksijcnes
Appropriate routing protocol in data transfer is a challenging problem of network in terms of lower end-to-end delay in delivery of data packets with improving packet delivery ratio and lower overhead as well. In this paper we explain an effective and scalable AODV (called as AODV-ES) for Wireless Ad hoc Sensor Networks (WASN) by using third party reply model, n-hop local ring and time-to-live based local recovery. Our goal is to reduce time delay for delivery of the data packets, routing overhead and improve the data packet delivery ratio. The resulting algorithm AODV-ES is then simulated by NS-2 under Linux operating system. The performance of routing protocol is evaluated under various mobility rates and found that the proposed routing protocol is better than AODV.
Secured Seamless Wi-Fi Enhancement in Dynamic Vehiclesijcnes
At present, cellular networks provide ubiquitous Internet connection, but with relatively expensive cost. Furthermore, the cellular networks have been proven to be insufficient for the surging amount of data from Internet enabled mobile devices. Due to the explosive growth of the subscriber number and the mobile data, cellular networks are suffering overload, and the users are experiencing service quality degradation. In this project implement seamless and efficient Wi-Fi based Internet access from moving vehicles. In our proposed implementation, a group of APs are employed to communicate with a client (called AP diversity), and the transmission succeeds if any AP in the group accomplishes the delivery with the client (called opportunistic transmission). Such AP diversity and opportunistic transmission are exploited to overcome the high packet loss rate, which is achieved by configuring all the APs with the same MAC and IP addresses. With such a configuration, a client gets a graceful illusion that only one (virtual) AP exists, and will always be associated with this virtual AP. Uplink communications, when the client transmits a packet to the virtual AP, actually multiple APs within its transmission range are able to receive it. The transmission is successful as long as at least one AP receives the packet correctly. Proposed implementation will show that outperforms existing schemes remarkably.
Virtual Position based Olsr Protocol for Wireless Sensor Networksijcnes
In wireless sensor networks usually taken in routing void problem in geographical routing in high control overhead and transmission delay .The routing void protocol is proposed in this paper is efficient bypassing void routing protocol. This protocol based on virtual co-ordinates is to transform a structure of random process in virtual circle .The circle are composed by void edge in to by mapping of edge nodes. In this paper to used the greedy forwarding algorithm. This algorithm can be process on virtual circle. The virtual circle greedy forwarding failing on routing void process. There are forwarding process are source to destination. The proposed protocol as find the shortest path, long transmission and High quality link maintenance.
Mitigation and control of Defeating Jammers using P-1 Factorizationijcnes
Jamming-resistant broadcast communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. These applications share the need for guaranteed authenticity and availability of messages which are broadcasted by base stations to a large and unknown number of (potentially untrusted) receivers. Common techniques to counter jamming attacks such as Direct-Sequence Spread Spectrum (DSSS) and Frequency Hopping are based on secrets that need to be shared between the sender and the receivers before the start of the communication. However, broadcast anti jamming communication that relies on Pollards Rho Method. In this work, we therefore propose a solution called P-Rho Method to enables spread-spectrum anti-jamming broadcast communication without the requirement of shared secrets. complete our work with an experimental evaluation on a prototype implementation.
An analysis and impact factors on Agriculture field using Data Mining Techniquesijcnes
In computing and information huge amount of data was provided in the storage. The task is to extract the specified data from the raw data. Data mining is one of the techniques that will extract the data. Data mining techniques are used in many places. The techniques like K-means, K nearest neighbor, support vector machine, bi clustering, navie bayes classifier, neural networks and fuzzy C-means are applied on agricultural data. There are many factors in agriculture. The main factors for the farmer are climate, soil and yield prediction. Farmer must know To improve their production select suitable crop for suitable climate. This paper provides the various concepts of Data mining, their applications and also discusses the research field in agriculture. This paper discusses the different types of factors that impact in the agriculture field.
A Study on Code Smell Detection with Refactoring Tools in Object Oriented Lan...ijcnes
A code smell is an indication in the source code that hypothetically indicates a design problem in the equivalent software. The Code smells are certain code lines which makes problems in source code. It also means that code lines are bad design shape or any code made by bad coding practices. Code smells are structural characteristics of software that may indicates a code or drawing problem that makes software hard to evolve and maintain, and may trigger refactoring of code. In this paper, we proposed some success issues for smell detection tools which can assistance to develop the user experience and therefore the acceptance of such tools. The process of detecting and removing code smells with refactoring can be overwhelming.
Priority Based Multi Sen Car Technique in WSNijcnes
In Wireless sensor network (WSN), Clustering is an efficient mechanism used to overcome energy capability problem, routing and load balancing. This paper addresses energy utilization and load distribution between the clusters. The load balanced clustering algorithms (LBC) used to decrease the energy utilization and distribute load into clusters. The SenCar uses multi-user multi-input and multi-output (MU-MIMO) technique which is introduced the multi SenCar to collects the information from each cluster heads and upload the data in the base station. This method achieves more than 50 percent energy saving per node, 80 percent energy saving on cluster heads and also achieves less data collection time compared to the existing system
Investigation on Challenges in Cloud Security to Provide Effective Cloud Comp...ijcnes
Cloud computing provides the capability to use computing and storage resources on a metered basis and reduce the investments in an organization�s computing infrastructure. The spawning and deletion of virtual machines running on physical hardware and being controlled by hypervisors is a cost-efficient and flexible computing paradigm. In addition, the integration and widespread availability of large amounts of sanitized information such as health care records can be of tremendous benefit to researchers and practitioners. However, as with any technology, the full potential of the cloud cannot be achieved without understanding its capabilities, vulnerabilities, advantages, and trade-offs. We propose a new method of achieving the maximum benefit from cloud computation with minimal risk. Issues such as data ownership, privacy protections, data mobility, quality of service and service levels, bandwidth costs, data protection, and support have to be tackled in order to achieve the maximum benefit from cloud computation with minimal risk.
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Student information management system project report ii.pdf
Semantic Search of E-Learning Documents Using Ontology Based System
1. Integrated Intelligent Research (IIR) International Journal of Business Intelligents
Volume: 05 Issue: 01 June 2016 Page No.25-27
ISSN: 2278-2400
25
Semantic Search of E-Learning Documents Using
Ontology Based System
D.Elangovan, K.Nirmala
Research Scholar, Manonmanium Sundaranar University, Thirunelveli.
Research supervisor & Associate professor, Department of computer science,Quaid-e-millath govt.college for women, Chennai
Email:delango_mca2000@yahoo.co.in
Abstract -The keyword searching mechanism is traditionally
used for information retrieval from Web based systems.
However, this system fails to meet the requirements in Web
searching of the expert knowledge base based on the popular
semantic systems. Semantic search of E-learning documents
based on ontology is increasingly adopted in information
retrieval systems. Ontology based system simplifies the task of
finding correct information on the Web by building a search
system based on the meaning of keyword instead of the keyword
itself. The major function of the ontology based system is the
development of specification of conceptualization which
enhances the connection between the information present in the
Web pages with that of the background knowledge.The semantic
gap existing between the keyword found in documents and those
in query can be matched suitably using Ontology based system.
This paper provides a detailed account of the semantic search of
E-learning documents using ontology based system by making
comparison between various ontology systems. Based on this
comparison, this survey attempts to identify the possible
directions for future research.
Keywords: ontology; semantic search; classification criteria.
I. INTRODUCTION
The ever increasing vast volume of information in the World
Wide Web presents new challenges and opportunities in the
development of systems for obtaining, organizing, accessing, and
updating information needed for various applications. Web
information retrieval system faces numerous challenges in
helping users to locate the required information accurately. In
addition, accessing and aggregating the information from various
sources automatically also poses serious challenges to current
retrieval systems. The aim of the Semantic Web is to expand the
functionality of the present Web standards and technology in
order to make the semantics of the Web a machine processible
system [1]. Ontology based system are used to improve the
interaction between human and machine. The Semantic Web
depends on the ontology based system for the purpose of
structuring the underlying data for inclusive and transportable
machine understanding. Thus, the success of the Semantic Web
depends strongly on the ontology based system. Ontology based
semantic search is fast becoming a recognized technique in the
information retrieval process which makes use of background
knowledge of the domain ontology.The research interest in
ontology based search has been ever growing. This paper
compares the different ontology based search techniques
developed in the recent years. The different approaches used in
the domain ontology to process search request will be discussed
in detail. The primary aim of the semantic search using ontology
based system is to maximize the three important parameters,
namely, precision, recall and F-Measure. The rest of the paper is
organized as follows. Section 2 discuss on the common
conditions used in the classification of semantic search
approaches using ontology. Section 3 describes selected papers
which have successfully implemented ontology system in
semantic Web retrieval system. Finally, Section 4 concludes the
paper.
II. CRITERIA USED IN THE CLASSIFICATION OF
ONTOLOGY
This section presents the most common criteria used in the
classification of ontology based search technologies.
2.1 Technology used in developing Ontology
The important criterion in the selection of ontology for Semantic
Web includes the technology upon which it is based on [14].
Ontology technologies includes various components like
inference engine, annotation tools, ontology based crawlers and
mining tools. The ontology description language is commonly
used to represent ontologies. Some of the standard ontology
description languages contains technologies like RDF and OWL.
For manipulating and storing the RDF data, AJAX and Java
enabled Jena API has been used.
2.2 Annotation technique used in Semantic
Semantic annotation concerns with the assigning of entities in the
text links to their respective semantic descriptions [12]. In
general, three types of semantic annotations are possible namely
Manual semantic annotation, Semi-automatic semantic
annotation and Automatic semantic annotation.
2.3 Indexing Process
The process of storing information for quicker retrieval based on
search query is called Indexing. A Search engine maintains the
contents it encounters during the crawling process and store as
indexes for the easier retrieval in future. The indexing process
simplifies the matching step and without an index the retrieval
process would require streaming through the collected Web
pages. The types of indexing are given below:
Forwarded index: Stores the list of words for each
document.
Inverted index: Stores the list of documents for each word.
2. Integrated Intelligent Research (IIR) International Journal of Business Intelligents
Volume: 05 Issue: 01 June 2016 Page No.25-27
ISSN: 2278-2400
26
Graph indexing: Given a query graph, look up an index and
retrieve the set of answers and verify those graphs that
contain the query graph and return the query results.
2.4 Ranking
Ranking determines the order of results during a search query
[5]. Search includes both matching and ranking. Matching
identifies the subset of elements that needs to be scored. Ranking
is the problem of determining the degree of matching using the
notions of relevance. It is performed after semantic mapping. The
rank will be calculated depending on the scoring of Web pages.
The results of the ranked Web page are indexed prior to returning
to the Web user. The type of ranking includes syntactic ranking
model and semantic ranking model. In syntactic ranking model,
the search is based on term matching between the query and the
engine database. It uses IR techniques like Tfi-df, Google Page
Rank’s interlink etc. On the other hand, in semantic ranking
model, the search depends on the relevance of results achieved
by bridging the gap between the syntax and semantics. This
results in better output and improves user satisfaction.
2.5 Information Retrieval Model (IR Model)
The IR model helps in providing a technique for formalization of
information searching process. There are three IR models
described in the literature which are as follows:
Boolean model – depends on keyword manipulation.
Vector model – depends on the user queries and treats
documents as vectors in the space generated by all the
terms.
Probabilistic model – depends on the mathematical model
and uses the theory of probability.
2.6 Performance improvements
The measurement metrics in ontology based semantic search
includes parameters like precision, recall, precision, F-measure
and mean average precision. The value of precision and recall
lies between 0 and 1 and maximum value is 1. By using the
ontological background knowledge of the search query terms, the
precision and recall value will be increased.
III. COMPARISON BETWEEN SELECTED
APPROACHES
In this section a detailed comparison of different approaches for
information retrieval process based on ontology based search
technique is presented.
Conceptual Graph Matching (CGM)
One of the earliest attempts in the ontology based search was
based on the Conceptual Graph Matching for Semantic Search
[2]. CGM was used as technique to describe the semantic
similarity between concept, relations and conceptual graph. Here,
semantic matching algorithm has been used to calculate the
relationship between a resource CG and a query CG.
XSEarch
It is an XML based semantic search engine that provides a
powerful and simple query language suitable for naïve user.
XSEarch forms the background for a semantic search engine
over XML documents. The result of XSEarch will be
semantically related document fragments instead of retrieving the
entire documents [3]. IR techniques like tfidf and similarity
measure between the query and document is employed in this
approach. Inverted index and ranking based on the semantic
relevance is used.
Ontology based Semantic Search
Here the resources to be retrieved are semantically annotated
using an existing platform. Then, using ontology the knowledge
domain which performs queries can be described [4]. This
approach has features like ontology navigation which enhances
retrieval of resources in terms of given query. In this approach,
annotations composed of RDF triples are used to semantically
describe the documents.
Vector Space Model for Ontology based IR
In this approach, ontology system is used for realizing semi-
automatic annotation of documents and for developing an
effective retrieval system [5]. A knowledge base has been built
and associated to the information source or document based by
using several domain ontologies that describes concepts
appearing in the document text.
Learning ontology-based user profiles: A semantic approach to
personalized Web search
In this approach, a personalized search that uses ontological
profiles by assigning implicitly derived interest scores to existing
concepts in domain ontology [6]. A spreading activation
algorithm was proposed for maintaining the interest score in the
user profile based on the users on going behavior. Each and
every concept in domain ontology is annotated based on the
interest score. The documents are indexed under concept along
with all of the documents under all of the sub concepts.
SPARK: adapting keyword query to semantic searchThis
approach is a more novel approach in which the keyword queries
are automatically translated into formal logic queries so that the
user can use keywords to perform semantic search [7]. Ontology-
based interpretation of keywords for semantic searchTran et al
(2009) developed an approach for translating keyword queries to
DL conjunctive queries based on the background knowledge
present in ontologies. The approach was demonstrated using
Lucene search engine. For a given search, the approach returns
the ontology entities with the information of neighboring entities
(upto width “d”) [8].
Q2semantic
Q2semantic proposed by Wang et al (2008) provides a scalable
search solution based on a novel clustered graph structure that
represents the summary of original ontology (Wang et al., 2008).
This approach adopted several mechanisms for query ranking
such as the query length, the relevance of ontology elements with
respect to the query and the importance of ontology elements.
Inverted index and query index were used for indexing. The
ranking is based on the matching of the keywords with respect to
the ontology elements such as concepts but not of relations and
attributes [9].
3. Integrated Intelligent Research (IIR) International Journal of Business Intelligents
Volume: 05 Issue: 01 June 2016 Page No.25-27
ISSN: 2278-2400
27
Improving data discovery for metadata repositories through
semantic search
Berkley et al. (2009) proposed a semantic search system using a
Metacat Metadata system that has the capability to store OWL-
DL ontologies in addition to semantic annotations that link
dataset attributes to ontology term. This advantage of the
approach is that the keyword search can be applied to annotation
by allowing more structured searches over annotations via
ontology terms [10].
An ontology-based approach for semantics ranking of the Web
search engines results
This approach uses new semantic based approach for the purpose
of evaluating IR system (Bouramoul et al., 2012). The proposed
approach improves the selectivity of search tool and also
enhances the evaluation procedure. This approach has been
proved to have improved the performance of search engine and
accuracy of the search results. Bouramoul et al. (2012) used
WordNet ontology for extracting query terms, semantic
projection and developed a vectorial model based on the
semantic vector comprises of concepts rather than words [11].
Designing ontology based domain specific Web search engine for
commonly used products using RDF
In this approach, the RDF content is stored for the domain
specific Web pages that exist in the domain specific repository
[12]. This approach has several advantages, for example, user
can obtain the basic information about the product from the
search result page and it is not required to visit the search result
links. This saves search time as well as Web page download cost
[12].
OntDR: An Ontology-based Augmented Method for Document
Retrieval
This approach incorporates ontology for document retrieval in
combination with array indexing [13]. The array indexing
establishes the inter relation between the documents.
IV. SMC MODEL
We implement the new model is called SMC (Semantic
Matched Concept) model. (In SMC Model, the Probability of
having both the Outcome O and Evidence E is: (Probability of O
occurring) multiplied by the (Prob of E given that O happened).
The evidence, P (Outcome or Evidence) = P(Evidence given that
the Outcome) times Prob (Outcome), scaled by the P(Evidence)
.This approach is called as SMC. P(outcome/evidence) =
P(Likelihood of Evidence) x Prior prob of outcome /
P(Evidence)In NavieBayes, to predict an outcome of multiple
evidence that case, the math gets very complicated. To get
around that complication, one approach is to 'uncouple' multiple
pieces of evidence, and to treat each of pieces of evidence as
independent.
V. CONCLUSION
This paper has discussed on the classification system adopted in
the semantic search system using ontology based approach. The
common factors are identified and described in detail. This
paper surveyed several ontological systems for semantic search
and the salient features were discussed. Furthermore, the research
is an ongoing work and several issues that need to be resolved
have been identified. It can be concluded from the paper that
even though large number of approaches are available for
information retrieval using ontology based system, they are not
proved to be adequate for certain tasks in semantics like
annotation, indexing and retrieval. Thus, the combination of
ontological system and the search system based on semantic
search can be useful as an essential tool for tasks like semantic
annotation, indexing and ranking for the purpose of quicker
retrieval of a search query results based on the meaning of the
term rather than on term. The existing methodology does not
support classification and it lacks accurate and not efficient. The
SMC model helps in getting relevant and meaningful e-content.
The advantages are user to fetch the semantic word from the e-
content.
Reference
[1] Shadbolt, Nigel, Wendy Hall, and Tim Berners-Lee. "The semantic Web
revisited." Intelligent Systems, IEEE 21.3 (2006): 96-101.
[2] Zhong, Jiwei, et al. "Conceptual graph matching for semantic search."
Conceptual Structures: Integration and Interfaces. Springer Berlin
Heidelberg, 2002.92-106.
[3] Cohen, Sara, et al. "XSEarch: A semantic search engine for XML."
Proceedings of the 29th international conference on Very large data bases-
Volume 29. VLDB Endowment, 2003.
[4] Bonino, Dario, et al. "Ontology driven semantic search." WSEAS
Transaction on Information Science and Application 1.6 (2004): 1597-1605.
[5] Castells, Pablo, Miriam Fernandez, and David Vallet. "An adaptation of the
vector-space model for ontology-based information retrieval." Knowledge
and Data Engineering, IEEE Transactions on 19.2 (2007): 261-272.
[6] Sieg, Ahu, Bamshad Mobasher, and Robin Burke. "Learning ontology
based user profiles: A semantic approach to personalized Web search."
IEEE Intelligent Informatics Bulletin 8.1 (2007): 7-18.
[7] Zhou, Qi, et al. "SPARK: adapting keyword query to semantic search." The
Semantic Web. Springer Berlin Heidelberg, 2007.694- 707
[8] Tran, Thanh, et al. "Ontology-based interpretation of keywords for semantic
search." The Semantic Web.Springer Berlin Heidelberg, 2007.523-536.
[9] Wang, Haofen, et al. "Q2semantic: A lightweight keyword interface to
semantic search." The Semantic Web: Research and Applications. Springer
Berlin Heidelberg, 2008.584-598.
[10] Berkley, Chad, et al. "Improving data discovery for metadata repositories
through semantic search." Complex, Intelligent and Software Intensive
Systems, 2009. CISIS'09. International Conference on IEEE, 2009.
[11] Bouramoul, Abdelkrim, Mohamed-Khireddine Kholladi, and Bich-Liên
Doan. "An ontology-based approach for semantics ranking of the Web
search engines results." Multimedia Computing and Systems (ICMCS),
2012 International Conference on. IEEE, 2012.
[12] Sinha, Sukanta, Rana Dattagupta, and Debajyoti Mukhopadhyay.
"Designing an ontology based domain specific Web search engine for
commonly used products using RDF." Proceedings of the CUBE
International Information Technology Conference. ACM, 2012.
[13] Yadav, Poonam, and R. P. Singh. "OntDR: An Ontology-based Augmented
Method for Document Retrieval." International Journal of Computer
Applications, 53, 17, 2012.
[14] Krötzsch, Markus. "Efficient rule-based inferencing for OWL EL."
Proceedings of the Twenty-Second international joint conference on
Artificial Intelligence-Volume Volume Three. AAAI Press, 2011.