@article {444,
	title = {Tensor graph-optimized linear discriminant analysis},
	journal = {Journal of Digital Information Management},
	volume = {12},
	year = {2014},
	note = {Export Date: 10 July 2014},
	month = {2014},
	pages = {31 - 35},
	abstract = {Graph-based Fisher Analysis (GbFA) is proposed recently for dimensionality reduction, which has the powerful discriminant ability. However, GbFA is based on the matrix-to-vector way, which not only costs much but also loses spatial relations of pixels in images. Therefore, Tensor Graph-based Linear Discriminant Analysis (TGbLDA) is proposed in the paper. TGbLDA regards samples as data in tensor space and gets projection matrixes through the iteration way. Besides, TGbLDA inherits merits of GbFA. Experiments on Yale and YaleB face datasets demonstrate the effectiveness of our proposed algorithm.},
	keywords = {Dimensionality reduction, Face recognition, Graph-based fisher discriminant analysis, Tensor data},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900431732\&partnerID=40\&md5=cbccd93685522d83cd7e46df5728b797},
	author = {Chen, J.}
}
@article {382,
	title = {Regularized orthogonal local fisher discriminant analysis},
	journal = {Journal of Digital Information Management},
	volume = {11},
	year = {2013},
	note = {Export Date: 10 July 2014},
	month = {2013},
	pages = {154 - 159},
	abstract = {Aiming at deficiencies of the ability for preserving local nonlinear structure of recently proposed Regularized Orthogonal Linear Discriminant Analysis (ROLDA) for dimensionality reduction, a kind of dimensionality reduction algorithm named Regularized Orthogonal Local Fisher Discriminant Analysis (ROLFDA) is proposed in the paper, which is originated from ROLDA. The algorithm introduce the idea of local structure preserving in Local Fisher Discriminant Analysis (LFDA) on the basic of ROLDA, following properties of ROLDA and strengthening the ability for capturing local structure information of data with nonlinear structures. Experiments on real face datasets demonstrate the effectiveness of our proposed algorithm.},
	keywords = {Dimensionality reduction, Local fisher discriminant analysis, Local nonlinear structure, Regularized orthogonal linear discriminant analysis},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879121480\&partnerID=40\&md5=294ec31f3b8631180e347dff9cae6b78},
	author = {Xu, S.}
}
@article {116,
	title = {Hybrid clustering approach for term partitioning in document data sets},
	journal = {Journal of Digital Information Management},
	volume = {6},
	year = {2008},
	note = {Export Date: 10 July 2014},
	month = {2008},
	pages = {272 - 277},
	abstract = {Information retrieval is one of the major research areas due to accumulation of huge information in digital form. Various techniques of Information retrieval are based on the fact that terms contained in a document along with their frequency of occurrence signify the semantics of the document. Recent attempts to find the relevant document for a context represents documents in a vector space model as document-term vector containing term weights for every index term in that document. As there will be enormous number of index terms this leads to high dimensionality problem. We can reduce the dimensionality based on the observation that groups of terms associated with related concepts occur together or do not occur in a document based on whether the document is relevant or not to that concept. Such a group of terms Is identified as an equivalence class and can be viewed as a single dimension in a Rough set based information retrieval system. In this paper we present a hybrid clustering approach for the formation of equivalence classes of terms associated with related concepts. It uses the outcome of hierarchical clustering to provide seed points for implementing Incremental K-means algorithm. Due to the sparsity of the term vector the cosine similarity estimate was found to be ineffective for term clustering. Another promising measure of proximity estimate used in information retrieval namely Euclidian distance has a drawback that It is biased towards changes in the term frequencies in larger documents when the term weights are represented by tf-ldf estimates. Hence we propose normalization for tf-idf estimates while representing a term as a vector in a document space before clustering the terms.},
	keywords = {Dimensionality reduction, Hierarchical clustering, K means algorithm, Partitional clustering, Text mining},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350735762\&partnerID=40\&md5=911fe260f9a7d869bf7ee8660851cdac},
	author = {Reddy, K.T. and Shashi, M. and Reddy, L.P.}
}
