Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A comparision of object oriented size evaluation techniques
Download
index.pdf
Date
2003
Author
Sırakaya, Hatice Sinem
Metadata
Show full item record
Item Usage Stats
114
views
0
downloads
Cite This
Popular Object Oriented size metrics and estimation methods are examined. A case study is conducted. Five of the methods (أLOCؤ, أOOPSؤ, أUse Case Points Methodؤ, أJ.Kammelar̕s Sizing Approachؤ and أMark II FPؤ) are applied to a project whose requirements are defined by means of use cases. Size and effort estimations are made and compared with the actual results of the project.
URI
http://etd.lib.metu.edu.tr/upload/721183/index.pdf
https://hdl.handle.net/11511/13233
Collections
Graduate School of Informatics, Thesis
Suggestions
OpenMETU
Core
A reformulation of the ant colony optimization algorithm for large scale structural optimization
Hasançebi, Oğuzhan; Saka, M.p. (2011-01-01)
This study intends to improve performance of ant colony optimization (ACO) method for structural optimization problems particularly with many design variables or when design variables are chosen from large discrete sets. The algorithm developed with ACO method employs the so-called pheromone scaling approach to overcome entrapment of the search in a poor local optimum and thus to recover efficiency of the method for large-scale optimization problems. Besides, a new formulation is proposed for the local upda...
A clustering method for web data with multi-type interrelated components
Bolelli, Levent; Ertekin Bolelli, Şeyda; Zhou, Ding; Giles, C Lee (2007-05-08)
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features. Many real world data, however, is heterogeneous in nature, comprising of multiple types of interrelated components. We present a clustering algorithm, K-SVMeans, that integrates the well known K-Means clustering with the highly popular Support Vector Machines(SVM) in order to utilize the richness of data. Our experimental results on author...
A Theoretical Analysis of Feature Fusion in Stacked Generalization
Ozay, Mete; Yarman Vural, Fatoş Tunay (2009-04-11)
In the present work, a theoretical framework in order to define the general performance of stacked generalization learning algorithm is developed. Analytical relationships between the performance of the Stacked Generalization classifier relative to the individual classifiers are constructed by the proposed theorems and the practical techniques are developed in order to optimize the performance of stacked generalization algorithm based on these relationships.
A fuzzy deductive object-oriented database model
Bostan, B; Yazıcı, Adnan (1998-05-09)
Object-oriented and deductive database models are two different paradigms in database modeling. As has been pointed out by many researchers, [1], [6], [14], each of these data models has its shortcomings when dealing with database/knowledge-base applications. Therefore, it is believed that combining object-oriented concepts with those of deductive database modeling results in a powerful data model especially for knowledge-intensive applications. In these applications, it is important to model and manipulate...
An access structure for similarity-based fuzzy databases
Yazıcı, Adnan (Elsevier BV, 1999-04-01)
A significant effort has been made in representing imprecise information in database models by using fuzzy set theory. However, the research directed toward access structures to handle fuzzy querying effectively is still at an immature stage. Fuzzy querying involves more complex processing than the ordinary querying does. Additionally, a larger number of tuples are possibly selected by fuzzy conditions in comparison to the crisp ones. It is obvious that the need for fast response time becomes very important...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. S. Sırakaya, “A comparision of object oriented size evaluation techniques,” M.S. - Master of Science, Middle East Technical University, 2003.