<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection: Research Article/Paper</title>
  <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/978" />
  <subtitle>Research Article/Paper</subtitle>
  <id>http://localhost:8080/xmlui/handle/123456789/978</id>
  <updated>2026-06-23T06:21:32Z</updated>
  <dc:date>2026-06-23T06:21:32Z</dc:date>
  <entry>
    <title>OUTLIER DETECTION USING CLUSTER-BASED APPROACH: A REVIEW</title>
    <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/995" />
    <author>
      <name>Bhangare, Mayuri A.</name>
    </author>
    <author>
      <name>Mankar, J. R.</name>
    </author>
    <id>http://localhost:8080/xmlui/handle/123456789/995</id>
    <updated>2018-05-30T09:37:37Z</updated>
    <published>2017-04-01T00:00:00Z</published>
    <summary type="text">Title: OUTLIER DETECTION USING CLUSTER-BASED APPROACH: A REVIEW
Authors: Bhangare, Mayuri A.; Mankar, J. R.
Abstract: Outlier detection is a crucial task in data&#xD;
mining which aims to detect an outlier from given&#xD;
data set. The data is said to be an outlier which&#xD;
appears to have inconsistent observation with the&#xD;
remaining data. Outliers are generated because of&#xD;
improper measurements, data entry errors or data&#xD;
arriving from various sources than remaining data.&#xD;
Outlier detection is the technique which discovers&#xD;
such type of data from the given data set. Several&#xD;
techniques of outlier detection have been&#xD;
introduced which requires input parameter from&#xD;
the user such as distance threshold, density&#xD;
threshold, etc. The goal of this proposed work is to&#xD;
partition the input data set into the number of&#xD;
clusters and then outlier is detected for each&#xD;
cluster. The computational time is affected as the&#xD;
data set size is reduced in first phase due to&#xD;
clustering. This work aims at studying two-three&#xD;
different methods of outlier detection with two&#xD;
different data sets. Also analyzing the performance&#xD;
of each method based on system accuracy.</summary>
    <dc:date>2017-04-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>A REVIEW ON IMAGE RETRIEVAL USING HYPERGRAPH</title>
    <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/994" />
    <author>
      <name>Kawale, Sandhya V.</name>
    </author>
    <author>
      <name>Kamlapurkar, S. M.</name>
    </author>
    <id>http://localhost:8080/xmlui/handle/123456789/994</id>
    <updated>2018-05-30T09:21:28Z</updated>
    <published>2017-04-01T00:00:00Z</published>
    <summary type="text">Title: A REVIEW ON IMAGE RETRIEVAL USING HYPERGRAPH
Authors: Kawale, Sandhya V.; Kamlapurkar, S. M.
Abstract: Retrieving images similar to query&#xD;
image from a large image collection is a challenging&#xD;
task. Image consists of different regions. There are&#xD;
several methods in the literature which are useful&#xD;
to capture region level similarities between pair of&#xD;
images using graph. Each image can be&#xD;
represented by several visual concepts. Visual&#xD;
concept is the object or part of the image having&#xD;
some visual information. There are several images&#xD;
in the database which can be sharing the same&#xD;
visual concepts. Graphs are fails to capture the&#xD;
relationship between multiple vertices. Hypergraph&#xD;
is useful to represent group relationship between&#xD;
multiple vertices. Consider database images as a&#xD;
vertices and visual concept as a hyperedge of a&#xD;
hypergraph. All the images sharing same visual&#xD;
concept, form a hyperedge. Ranking methods on&#xD;
these hypergraph is design, to rank all the images&#xD;
in the database which are relevant to the query.&#xD;
Top k images are retrieved from these images&#xD;
which will handle query relevant image retrieval</summary>
    <dc:date>2017-04-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>TEXTURE CLASSIFICATION METHODS: A REVIEW</title>
    <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/993" />
    <author>
      <name>Bhandare, Sonal B.</name>
    </author>
    <author>
      <name>Kamlapurkar, S. M.</name>
    </author>
    <id>http://localhost:8080/xmlui/handle/123456789/993</id>
    <updated>2018-05-30T09:11:17Z</updated>
    <published>2017-04-01T00:00:00Z</published>
    <summary type="text">Title: TEXTURE CLASSIFICATION METHODS: A REVIEW
Authors: Bhandare, Sonal B.; Kamlapurkar, S. M.
Abstract: Texture classification is an important&#xD;
area of re-search in pattern recognition and image&#xD;
processing. It is widely used in real world&#xD;
applications like object detection, face recognition,&#xD;
medical image processing, agriculture etc. Texture&#xD;
has no deterministic shape or specific structure like&#xD;
other natural images. Texture is treated as&#xD;
indication for getting significant knowledge about&#xD;
the texture class. Since last one decade texture&#xD;
classification methods mainly uses patch based&#xD;
local features and feature encoding techniques. So&#xD;
in this paper some representative methods for each&#xD;
of the context are analysed.</summary>
    <dc:date>2017-04-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>A Review on Label Prediction through Multiple Visual Features</title>
    <link rel="alternate" href="http://localhost:8080/xmlui/handle/123456789/992" />
    <author>
      <name>Narkhede, Dhanshree S.</name>
    </author>
    <author>
      <name>Mankar, J. R.</name>
    </author>
    <id>http://localhost:8080/xmlui/handle/123456789/992</id>
    <updated>2018-05-30T09:04:31Z</updated>
    <published>2017-03-01T00:00:00Z</published>
    <summary type="text">Title: A Review on Label Prediction through Multiple Visual Features
Authors: Narkhede, Dhanshree S.; Mankar, J. R.
Abstract: Multiple visual features are represented by&#xD;
multimedia data. Multi-feature learning aims at using the&#xD;
complementary structural information of visual features. The&#xD;
focus is on the semi-supervised learning when the label&#xD;
information of the training data is insufficient. Most of the&#xD;
existing systems face the problem of insufficient labelled data&#xD;
that are expensive to label by hand in real-world application.&#xD;
To address this problem classifier has been already proposed&#xD;
in the literature that select features closely similar to the&#xD;
query image and based on these features label prediction is&#xD;
done. This work aims at studying different low-level feature&#xD;
descriptor for better feature extraction and focusing on&#xD;
computational time of the system by replacing SIFT&#xD;
descriptor by ORB feature descriptor</summary>
    <dc:date>2017-03-01T00:00:00Z</dc:date>
  </entry>
</feed>

