web search engine uses indexing for management of web-pages in a mannered way. web-pages are well distributed within the database of server. Both forward and inverted indexing is employed to tackle web-pages as a part...
详细信息
This paper reports a generic analysis on null boundary and periodic boundary 3-neighborhood multiple attractor cellular automata (MACA) for showing the comparative study in classification technique. Cellular automata ...
详细信息
This paper reports a generic analysis on null boundary and periodic boundary 3-neighborhood multiple attractor cellular automata (MACA) for showing the comparative study in classification technique. Cellular automata (CA) is now-a-days an essential tool for researchers in the area of pattern recognition, pattern generation, testing field, fault diagnosis and so on. So, general knowledge on CA up to some extent is a must for researchers in these areas. A CA may be linear or non-linear in behavior. A linear/additive CA employs XOR/XNOR logic, while a non-linear CA employs AND/OR/NOT logic. This paper shows a graph analysis along with state transition behavior of CA cells. A rule vector graph (RVG) is generated from the rule vector (RV) of a CA. Linear time algorithms are reported for generation of RVG. MACA provides an implicit memory to store the patterns. Search operation to identify the class of a pattern out of several classes boils down to running a CA for one time step. This demands storage of RV and seed values. MACA is based on sound theoretical foundation of CA technology. This paper only concentrates on MACA since it is responsible for classifying the various types of patterns.
web Search Engine uses forward indexing and inverted indexing as a part of its functional design. This indexing mechanism helps retrieving data from the database based on user query. In this paper, an efficient soluti...
详细信息
ISBN:
(纸本)9783540739395
web Search Engine uses forward indexing and inverted indexing as a part of its functional design. This indexing mechanism helps retrieving data from the database based on user query. In this paper, an efficient solution to handle the indexing problem is proposed with the introduction of Nonlinear Single Cycle Multiple Attractor Cellular Automata (SMACA). This work simultaneously shows generation of SMACA by using specific rule sequence. Searching mechanism is done with linear time complexity.
The web has grown in leaps and bounce in the last decade. The size of the web has become so large that it has become very difficult to find out the necessary information from the web. Search engines help us in our que...
详细信息
In this paper we describe a technique for automatic construction of ontology, a semantic representation of a conceptualization, for any domain, organization or enterprise whose web site is existent with quiet a big mi...
详细信息
A domain specific web search engine is a search engine which replies to domain specific user queries. The crawler in a domain specific search engine must crawl through the domain specific web pages in the World Wide W...
详细信息
An extremely large number of web pages in the Internet contain free texts in natural language that are only read by human beings. To be understood by machines, these pages should be annotated with semantic markups. Ma...
详细信息
In this paper we describe a technique for automatic construction of ontology, a semantic representation of a conceptualization, for any domain, organization or enterprise whose web site is existent with quiet a big mi...
详细信息
In this paper we describe a technique for automatic construction of ontology, a semantic representation of a conceptualization, for any domain, organization or enterprise whose web site is existent with quiet a big mine of information. An user interactive system is developed with the help of which any organization, which has a web site to maintain data, but has no corresponding semantic mark up, can automatically construct the ontology and further use that to model domain knowledge and make use of various semantic web applications like semantic web search engine etc. The automated construction of ontology will facilitate further the growth, popularity and usage of the semantic web and semantic web technologies as well as serve as a basis for artificial intelligence reasoning.
An extremely large number of web pages in the Internet contain free texts in natural language that are only read by human beings. To be understood by machines, these pages should be annotated with semantic markups. Ma...
详细信息
An extremely large number of web pages in the Internet contain free texts in natural language that are only read by human beings. To be understood by machines, these pages should be annotated with semantic markups. Manually annotating large number of pages is an arduous work. This has made automatic semantic annotation an urgent challenge. In this paper, we propose machine learning based automatic annotation approach. This approach can be trained for different domains and requires nearly no manual rules.
The web has grown in leaps and bounce in the last decade. The size of the web has become so large that it has become very difficult to find out the necessary information from the web. Search engines help us in our que...
详细信息
The web has grown in leaps and bounce in the last decade. The size of the web has become so large that it has become very difficult to find out the necessary information from the web. Search engines help us in our quest of finding the required information on the web. These search engines over the years have also developed themselves in a grand manner. With the advent of ontology based search engine, has only helped the cause. Ontology based search engines are transforming the whole idea of searching into a new league of its own. In this paper we propose a novel approach for proper construction and searching ontology. This proposition of ours will help in the development of a very well organized ontology which in tern will help us in searching the web in a very useful and organized manner. Thus reducing the unwanted search results.
暂无评论