Loading...
Search for: knowledge-discovery
0.01 seconds

    Enhancing the Performance of Distributed Data Mining in Grid Environments

    , M.Sc. Thesis Sharif University of Technology Imani Varzeghani, Alireza (Author) ; Movaghar Rahimabadi, Ali (Supervisor)
    Abstract
    Nowadays, due to the high volume of raw data stored in databases and high speed accumulation of stored data, it is necessary to obtain the knowledge lied behind these data. Datamining is used to solve this problem. Since data are distributed in information systems and it is not possible to integrate them in a single place, Distributed data mining is required. Grid is a useful infrastructure that can be used for distributed data mining and knowledge discovery. Grid-based datamining services enable users to create and manage applications for knowledge discovery.
    Generally, the proposed architecture is a hierarchical architecture, in which web services are used for distributed datamining.... 

    Erratum to A linear genetic programming approach for the prediction of solar global radiation

    , Article Neural Computing and Applications ; Volume 23, Issue 3-4 , 2013 , Pages 1205- ; 09410643 (ISSN) Shavandi, H ; Saeidi Ramiyani, S ; Sharif University of Technology
    2013

    Knowledge discovery using a new interpretable simulated annealing based fuzzy classification system

    , Article Proceedings - 2009 1st Asian Conference on Intelligent Information and Database Systems, ACIIDS 2009, 1 April 2009 through 3 April 2009, Dong Hoi ; 2009 , Pages 271-276 ; 9780769535807 (ISBN) Mohamadia, H ; Habibib, J ; Moavena, S ; Sharif University of Technology
    2009
    Abstract
    This paper presents a new interpretable fuzzy classification system. Simulated annealing heuristic is employed to effectively investigate the large search space usually associated with classification problem. Here, two criteria are used to evaluate the proposed method. The first criterion is accuracy of extracted fuzzy if-then rules, and the other is comprehensibility of obtained rules. Experiments are performed with some data sets from UCI machine learning repository. Results are compared with several well-known classification algorithms, and show that the proposed approach provides more accurate and interpretable classification system. © 2009 IEEE  

    Circluster: storing cluster shapes for clustering

    , Article 2008 4th International IEEE Conference Intelligent Systems, IS 2008, Varna, 6 September 2008 through 8 September 2008 ; Volume 3 , 2008 , Pages 1114-1119 ; 9781424417391 (ISBN) Shirali Shahreza, S ; Hassas Yeganeh, S ; Abolhassani, H ; Habibi, J ; Sharif University of Technology
    2008
    Abstract
    One of the important problems in knowledge discovery from data is clustering. Clustering is the problem of partitioning a set of data using unsupervised techniques. An important characteristic of a clustering technique is the shape of the cluster it can find. Clustering methods which are capable to find simple cluster shapes are usually fast but inaccurate for complex data sets. Ones capable to find complex cluster shapes are usually not fast but accurate. In this paper, we propose a simple clustering technique named circlusters. Circlusters are circles partitioned into different radius sectors. Circlusters can be used to create hybrid approaches with density based or partitioning based... 

    Advantages of dependency parsing for free word order natural languages

    , Article 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015, 24 January 2015 through 29 January 2015 ; Volume 8939 , 2015 , Pages 511-518 ; 03029743 (ISSN) ; 9783662460771 (ISBN) Mirlohi Falavarjani, S. A ; Ghassem Sani, G ; Sharif University of Technology
    Springer Verlag  2015
    Abstract
    An important reason to prefer dependency parsing over classical phrased based methods, especially for languages such as Persian, with the property of being “free word order”, is that this particular property has a negative impact on the accuracy of conventional parsing methods. In Persian, some words such as adverbs can freely be moved within a sentence without affecting its correctness or meaning. In this paper, we illustrate the robustness of dependency parsing against this particular problem by training two well-known dependency parsers, namely MST Parser and Malt Parser, using a Persian dependency corpus called Dadegan. We divided the corpus into two separate parts including only...