TITLE

Framework For Mixed Entity Resolving System Using Unsupervised Clustering

PUB. DATE
December 2010
SOURCE
Journal of Digital Information Management;Dec2010, Vol. 8 Issue 6, p362
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
58488920

 

Related Articles

  • SURVEY ON CLUSTERING ALGORITHM AND SIMILARITY MEASURE FOR CATEGORICAL DATA. Elavarasi, S. Anitha; Akilandeswari, J. // ICTACT Journal on Soft Computing;Jan2014, Vol. 4 Issue 2, p715 

    Learning is the process of generating useful information from a huge volume of data. Learning can be either supervised learning (e.g. classification) or unsupervised learning (e.g. Clustering) Clustering is the process of grouping a set of physical objects into classes of similar object. Objects...

  • Refinement of Web usage Data Clustering from K-means with Genetic Algorithm. Sujatha, N.; Iyakutty, K. // European Journal of Scientific Research;Jun2010, Vol. 42 Issue 3, p464 

    Web usage mining involves application of data mining techniques to discover usage patterns from the web data. Clustering is one of the important functions in web usage mining. Recent attempts have adapted the K-means clustering algorithm as well as genetic algorithms based on rough sets to find...

  • Mining for Computing Jobs. Litecky, Chuck; Aken, Andrew; Ahmnd, Altaf; Nelson, H. James // IEEE Software;Jan/Feb2010, Vol. 27 Issue 1, p78 

    The article discusses the use of Web content data mining application to help software engineering professionals to improve their skills portfolio to match the in demand real computing jobs in the U.S. The employed data collection and analysis methods used are also cited, including cluster...

  • A Risk Matrix Approach Based on Clustering Algorithm. Lin He; Yan Chen; LanYing Liu // Journal of Applied Sciences;2013, Vol. 13 Issue 20, p4188 

    The traditional risk matrix is insufficient in some cases due to the static, non-meticulous classification of probability and severity defined without considering of the context. In order to deal with this issue, this study proposes an extended RMA method (eRIA), by adding probability level and...

  • A New Hybrid Algorithm Based on Artificial fishes swarm Optimization and K-means for Cluster Analysis. Neshat, Mehdi; Yazdani, Danial; Gholami, Elham; Masoumi, Azra; Sargolzae, Mehdi // International Journal of Computer Science Issues (IJCSI);Jul2011, Vol. 8 Issue 4, p251 

    Data clustering has been used in different fields such as machine learning, data mining, wireless sensory networks and pattern recognition. One of the most well-known clustering methods is K-means which has been used effectively in many of clustering problems. But this algorithm has problems...

  • A Density-Based Method for Initializing the K-means Clustering Algorithm. Xuanyi Zhang; Qiang Shen; Haiyang Gao; Zhijun Zhao; Song Ci // International Proceedings of Computer Science & Information Tech;2012, Vol. 46, p46 

    The k-means algorithm is a commonly used technique in data mining. However, it is sensitive to the initial clustering centers. To reduce the sensitivity and get a better initialization solution, we present a density-based method for initializing the K-means clustering algorithm in this paper....

  • Enhanced K-Means Clustering Algorithm to Reduce Time Complexity for Numeric Values. Bangoria Bhoomi, M. // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 1, p876 

    Data mining is the process of using technology to identify patterns and prospects from large amount of information. In Data Mining, Clustering is an important research topic and wide range of unverified classification application. Clustering is technique which divides a data into meaningful...

  • Indiscernibility based cluster analysis. Jain, Pragati; Jain, Manisha // International Journal of Applied Engineering Research (0976-4259;2011, Vol. 1 Issue 4, p824 

    Cluster Analysis is an indispensable part of data mining. It has a wider application now days. The paper comprises of rough set approaches wherein indiscernibility relation for similarity measures plays an important role in cluster analysis. Such type of relation gives rise to indiscernible...

  • A framework for dissimilarity-based partitioning clustering of categorical time series. García-Magariños, Manuel; Vilar, José // Data Mining & Knowledge Discovery;Mar2015, Vol. 29 Issue 2, p466 

    A new framework for clustering categorical time series is proposed. In our approach, a dissimilarity-based partitioning method is considered. We suggest measuring the dissimilarity between two categorical time series by assessing both closeness of raw categorical values and proximity between...

  • Active Clustering based Classification for Cost Effective Prediction in few Labeled Data Problem. SZŰCS, Gábor; HENK, Zsuzsanna // Economy Informatics;2015, Vol. 15 Issue 1, p5 

    In many data mining problems related to business it is hard to obtain labeled instances. When the labeled data set is not large enough the classifiers often perform poor results. Nevertheless semi-supervised learning algorithms, e.g. clustering based classification can learn from both labeled...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics