International Journal of Engineering Trends and Technology (IJETT) - Volume4Issue5- May 2013

Association Orders between Name and Aliases from the Web

K.Sarada*, K.P.N.V.Satya Sree 2, K.V.Narasimha Reddy 3 Department Of Computer Science & Engineering 1*, 2, 3 Vignans Nirula Institute Of Technology And Science For Women, Guntur 1*, Abstract Due to the increase in the size of World Wide Web, Content Based Retrieval becomes more challenging and also it provides lot of irrelevant results. We propose a new Concept and Content Based Text Retrieval technique to provide exact results. We use Associative mining technique with the semantic concepts. Our methodology indexes the texts according to semantic concepts and generates association which will be used for Text retrieval. We extract the high level concepts Introduction World wide web resources increasing every day and the growth of the web resources makes the information retrieval as a challenging task. Particularly the text retrieval in the web becomes more complicated due to the growth of the web resources. There exists few techniques for content based text retrieval, but suffers with the efficiency of providing better and appropriate results. For example Google provides text search as a concept based one and also it provides lots of irrelevant results. For a content based system to be successful , it need to minimize the gap between analysts model of visual patterns and computers representation of information. Content based system enables the user to easily access to text databases using query methods similar to reasoning. Researches that use semantic methods proved to better mimic knowledge that represent visual patterns. Fonseca at al.[1] proposes an ontology-driven aerial-information system for classifying content based system that uses complex-query methods such as shape, multi object relationships and semantics. In this paper, we propose a text retrieval technique that uses content and concept based methods and association rules to link visual semantics to the concepts. We provide the query by example and query by concepts for the efficient retrieval of texts. we deal with shapes, the only information usually available is the underlying geometry. Appropriate features are chosen to encode this geometry as richly as

and low level features. The extracted feature vectors are indexed to a semantic concept, and we generate association rules, using which the retrieval is done. We use both the visual and texture features to represent the semantic concept. This CCBR is very help full in both data collection and modeling large scale text data bases. Index Terms: Semantics , CBR, Associative Technique, Semantic Search Engines. possible, without compromising on robustness. Quite clearly, the set of useful features varies depending on the particular application at hand. For example, invariance to articulations of part structures is very important in applications like gait-based human identification whereas the same feature is not desired for applications like retrieval based on human pose. Our goal here is to develop system that supports fast retrieval of shapes without needing any costly correspondence step during matching. To this end, we use (or propose) features that address most challenges faced by shape matching tasks including invariance to object translation, rotation, scale, articulations, etc. In the proposed indexing framework, a given shape is represented using a collection of feature vectors, each characterizing a geometrical relationship between a pair of landmark points. The features should be easily computable for the matching algorithm to be efficient and to be able to scale up to large database sizes. For each landmark pair, depending on the application, all or a subset of the following geometrical characteristics are encoded in the corresponding feature vector. Proposed Method The following picture represents the block diagram of our proposed system:

ISSN: 2231-5381

http://www.ijettjournal.org

Page 1965

International Journal of Engineering Trends and Technology (IJETT) - Volume4Issue5- May 2013
Crawled

text

Preprocessing

Feature extraction

visual and texture feature Indexing System

Input text or concept

Association rule generation

Perform cbir & return results

Identify concept

Compute relevance score

Preprocessing We perform preprocessing on the web crawled text; first the crawled text is converted to a fixed shape in order to map features into unique size. The scaled text is converted to gray scale and edge detection is performed. We extract the shape feature from the edge detected text. The extracted raw feature is normalized to fixed size. We use general algorithms for edge detection on the input texts. The extracted texture feature is mapped to unique size for indexing. Visual and Texture feature Indexing: The extracted feature vectors are indexed to a semantic concept based on the relevance score. We compute the relevancy score with all the texts in a semantic concept. The feature vector is assigned a label to the semantic concept only if the similarity of texts below the semantic is more similar to the input text. We compute cosine similarity method to compute the similarity between two feature vectors. The identified feature vector is indexed into the semantic with the label. We compute similarity values with both visual and texture features. Algorithm1: Step1: Crawl texts from internet. Step2: Apply sobel edge detector. Step3: Extract raw features. Step4: Normalize to same size. Step5: compute relevancy score with the Semantic concepts.

Compute cosine similarity(Euclidean distance )between selected feature vector and a single vector under semantic concept. Vdis=(Vi-Vj)------------(1). Vi Selected Feature from input set. Vj Selected feature under a semantic concept. Srs=(Nk/Tk)*100 ---(2). Nk-No of feature vectors matched. Tk- Total number of features available under particular semantic concept. Step6: repeat step 5 for all semantic Concept. Step7: Identify the concept the feature related. Step 8: Index the vector under the semantic concept. Association Rule Generation We extract the full feature subspace indexed into the system and generate decision rules. Each rule has set of feature sub space and unique semantic. The association rules are generated using Total from partial approach. The generated rules are evaluated using wilcoxon signed rank test. The newly sorted rule is added to the model. Concept Query The input concept is used to perform text retrieval. We calculate the similarity score with all the association rules available in the indexed system. Based on the concept identified we compute the relevance score with all the textual feature assigned to the texts in the concept category. We sort the texts according to the relevance score and return the results.

ISSN: 2231-5381

http://www.ijettjournal.org

Page 1966

International Journal of Engineering Trends and Technology (IJETT) - Volume4Issue5- May 2013

Algorithm2: Step1: Receive the concept query. Step2: compute relevancy score with the All semantic concepts. Compute cosine similarity(Euclidean distance )between selected concept and a single term under semantic concept. Vdis=(Vi-Vj)------------(1). Vi input concept. Vj Selected term under a semantic concept. Srs=(Nk/Tk)*100 ---(2). Nk-No of keywords matched. Tk- Total number of keywords available under particular semantic concept. Step3: repeat step 5 for all semantic Concept. Step4: Identify the concept the concept query related. Step5: retrieve all texts under the semantic concept. Step6: return results. Content Query: In this method we preprocess the text and extract both visual and texture features and normalize Conclusion The proposed method produces relevant results accurately. We further investigate this method

the feature vectors. Using the extracted feature vectors we compute the relevance score with all the association rules. We compute the weight for each rule and sort the score. Based on the score we extract the feature vectors identified and return as results. Step1: Read Input Text. Step2: Apply sobel edge detector. Step3: Extract raw features. Step4: Normalize to same size. Step5: compute relevancy score with the Semantic concepts. Compute cosine similarity(Euclidean distance )between selected feature vector and a single vector under semantic concept. Vdis=(Vi-Vj)------------(1). Vi Selected Feature from input set. Vj Selected feature under a semantic concept. Srs=(Nk/Tk)*100 ---(2). Nk-No of feature vectors matched. Tk- Total number of features available under particular semantic concept. Step6: repeat step 5 for all semantic Concept. Step7: Identify the concept the feature related. Step8: retrieve relevant texts and return results. and improve the efficiency of the result produces. [6] D. Sharvit, J. Chan, H. Tek, and B. B. Kimia, Symmetry-based indexing of text databases, J. Vis. Commun. Text Represent., vol. 9, no. 4, pp. 366380, 1998. [7] T. B. Sebastian, P. N. Klein, and B. B. Kimia, Recognition of shapes by editing their shock graphs, IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 5, pp. 550571, May 2004. [8] B. Leibe and B. Schiele, Analyzing appearance and contour based methods for object categorization, in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2003. [9] S. Biswas, G. Aggarwal, and R. Chellappa, Efficient indexing for articulation invariant shape matching and retrieval, in Proc. IEEE Conf. Computer Vision and Pattern Recognition , 2007, pp. 18. [10] G. Mori and J. Malik, Recognizing objects in adversarial clutter: Breaking a visual captcha, in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2003, pp. 134141. [11] Z. Tu and A. L. Yuille, Shape matching and recognition: Using generative models and informative features, in Proc. Eur. Conf. Computer Vision, 2004, pp. 195209.

References [1] L. J. Latecki, R. Lakamper, and U. Eckhardt, Shape descriptors for non-rigid shapes with a single closed contour, in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2000, pp. 424429. [2] S. Belongie, J. Malik, and J. Puzicha, Shape matching and object recognition using shape contexts, IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 4, pp. 509522, Apr. 2002. [3] H. Ling and D. W. Jacobs, Shape classification using the inner-distance, IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 2, pp. 286299, Feb. 2007. [4] C. Rao, A. Yilmaz, and M. Shah, Viewinvariant representation and recognition of actions, Int. J. Comput. Vis., vol. 50, no. 2, pp. 203226,2002. [5] Y.Wang, H. Jiang, M. Drew, L. Ze-Nian, and G. Mori, Unsupervised discovery of action classes, in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2006, pp. 16541661.

ISSN: 2231-5381

http://www.ijettjournal.org

Page 1967

International Journal of Engineering Trends and Technology (IJETT) - Volume4Issue5- May 2013

[1] K.Sarada M.Tech (CSE) Department of Computer Science & Engineering at Vignans Nirula Institute Of Technology & Science for Women, Guntur.

[2] K.P.N.V.Satya Sree Asst. Professor Department of Computer Science & Engineering at Vignans Nirula Institute Of Technology & Science for Women, Guntur. He guided many projects in the area of image processing for CSE & IT Departments. His research interests are in the areas of Datamining and Image Processing.

[3] K.V.Narasimha Reddy received the B.Tech(CSE) from JNTUH, M.Tech(C.S.E) from JNTUK he is currently working as an Assistant Professor & Head of the Department of Computer Science & Engineering at Vignans Nirula Institute Of Technology & Science for Women, Guntur. He guided many projects in the area of image processing for CSE & IT Departments. His research interests are in the areas of Datamining and Image Processing.

ISSN: 2231-5381

http://www.ijettjournal.org

Page 1968