Search Results/Filters    

Filters

Year

Banks




Expert Group











Full-Text


Issue Info: 
  • Year: 

    2021
  • Volume: 

    15
  • Issue: 

    1
  • Pages: 

    19-24
Measures: 
  • Citations: 

    0
  • Views: 

    171
  • Downloads: 

    111
Abstract: 

Ensemble Clustering (EC) methods became more popular in recent years. In this methods, some primary clustering Algorithms are considered to be as inputs and a single cluster is generated to achieve the best results combined with each other. In this paper, we considered three hierarchical methods, which are single-Link, average-Link, and complete-Link as the primary clustering and the results were combined with each other. This combination was done based on correlation matrix. The basic Algorithms were combined as binary and triplicate and the results were evaluated as well. the IMDB film dataset were clustered based on existing features. CH, Silhouette and Dunn Index criteria were used to evaluate the results. These criteria evaluate the clustering quality by calculating intra-cluster and inter-cluster distances. CH index had the highest value when all three basic clusters are combined. Our method shows that EC can achieve better results and present clusters with higher robustness and accuracy.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 171

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 111 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2017
  • Volume: 

    9
  • Issue: 

    1
  • Pages: 

    45-51
Measures: 
  • Citations: 

    0
  • Views: 

    154
  • Downloads: 

    77
Abstract: 

Discovering communities in time-varying social networks is one of the highly challenging area of research and researchers are welcome to propose new models for this domain. The issue is more problematic when overlapping structure of communities is going to be considered. In this research, we present a new online and incremental community detection Algorithm called Link-clustering which uses Link-based clustering paradigm intertwined with a novel representative-based Algorithm to handle these issues. The Algorithm works in both weighted and binary networks and intrinsically allows for overlapping communities. Comparison with the state of art evolutionary Algorithms and Link-based clustering shows the accuracy of this method in detecting communities over times and motivates the extended research in Link-based clustering paradigm for dynamic overlapping community detection purpose.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 154

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 77 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2024
  • Volume: 

    10
Measures: 
  • Views: 

    53
  • Downloads: 

    0
Abstract: 

The increasing growth of social networks has drawn researchers' attention to Link prediction, and it has been used in many fields, including computer science, information science, and anthropology. One of the newest Link prediction methods is graph embedding methods, which are used to generate a feature vector for each node of the graph and find unknown Links. The DeepWalk Algorithm is one of the most popular graph embedding methods that captures the network structure using a random walk with equal probability. In this paper, a modified version of the DeepWalk Algorithm is proposed, which uses a new random walk model to solve the Link prediction problem. In fact, in the proposed method, the amount of structural similarity and the similarity of important features of nodes are combined. The results show that two nodes are more likely to form a Link if they have similar structure and important features. To evaluate the proposed method, experiments have been conducted on five datasets. The test results indicate a relative improvement in the results obtained.

Yearly Impact:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 53

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0
Issue Info: 
  • Year: 

    2017
  • Volume: 

    5
  • Issue: 

    3
  • Pages: 

    146-154
Measures: 
  • Citations: 

    0
  • Views: 

    418
  • Downloads: 

    160
Abstract: 

Predicting collaboration between two authors, using their research interests, is one of the important issues that could improve the group researches. One type of social networks is the co-authorship network that is one of the most widely used data sets for studying. As a part of recent improvements of research, far much attention is devoted to the computational analysis of these social networks. The dynamics of these networks makes them challenging to study. Link prediction is one of the main problems in social networks analysis. If we represent a social network with a graph, Link prediction means predicting edges that will be created between nodes in the future. The output of Link prediction Algorithms is using in the various areas such as recommender systems. Also, collaboration prediction between two authors using their research interests is one of the issues that improve group researches. There are few studies on Link prediction that use content published by nodes for predicting collaboration between them. In this study, a new Link prediction Algorithm is developed based on the people interests. By extracting fields that authors have worked on them via analyzing papers published by them, this Algorithm predicts their communication in future. The results of tests on SID dataset as co-author dataset show that developed Algorithm outperforms all the structure-based Link prediction Algorithms. Finally, the reasons of Algorithm’s efficiency are analyzed and presented.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 418

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 160 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Journal: 

Arman Process Journal

Issue Info: 
  • Year: 

    2024
  • Volume: 

    5
  • Issue: 

    4
  • Pages: 

    1-14
Measures: 
  • Citations: 

    0
  • Views: 

    80
  • Downloads: 

    0
Abstract: 

Social networks are primarily represented and analyzed in the form of graphs with a large number of vertices and edges, structured as an adjacency matrix. The edges indicate relationships between individuals and act as connections between the vertices. The structural characteristics of each network are determined by the features of the edges and vertices within it. In this research, conducted on various types of social network data from the Stanford University database, a preprocessing method was employed using a competitive colonial Algorithm for feature selection with the highest merit (lowest cost). To evaluate the impact of feature selection on the final output, experiments were conducted both with and without feature selection operations using various Algorithms commonly used in this field. Valid metrics such as accuracy, precision, sensitivity, and recall were independently measured on the output results with an average of 10 program executions. The comparison of results between scenarios with and without feature selection showed a significant impact on all metrics of the final outcome. Many features in the datasets were either unused or contained minimal information. Not removing these features not only increased the computational burden but also affected the accuracy of the output results due to time-consuming execution.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 80

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

KAVEH A. | SHOJAEI SETAREH

Issue Info: 
  • Year: 

    2003
  • Volume: 

    4
  • Issue: 

    2-4
  • Pages: 

    115-133
Measures: 
  • Citations: 

    0
  • Views: 

    331
  • Downloads: 

    154
Abstract: 

In this article the genetic Algorithm is employed to optimize scissor-Link foldable structures. The Advantage of using GA lies in the fact that the discrete spaces can be optimized without any Complexity. Here displacement method is used for analysis with uniplet elements.      

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 331

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 154 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 4
Author(s): 

Biazar Jafar | Ebrahimi Hamed

Issue Info: 
  • Year: 

    2024
  • Volume: 

    12
  • Issue: 

    1
  • Pages: 

    117-135
Measures: 
  • Citations: 

    0
  • Views: 

    29
  • Downloads: 

    4
Abstract: 

In the current study, a one-step numerical Algorithm is presented to solve strongly non-linear Full fractional duffing equations. A new fractional-order operational matrix of integration via  quasi-hat functions (QHFs) is introduced. Utilizing the operational matrices of QHFs, the main problem will be transformed into  a number of univariate polynomial equations. Absolute errors of the results in approximations and convergence analysis are addressed. Ultimately, five examples are provided to illustrate the capabilities of this Algorithm. The numerical results are illustrated in some Tables and Figures, for different values of the parameters $\alpha~ and~ \beta$.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 29

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 4 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

EBRAHIMI S. | PEIVANDI P.

Issue Info: 
  • Year: 

    2014
  • Volume: 

    26
  • Issue: 

    3
  • Pages: 

    0-0
Measures: 
  • Citations: 

    1
  • Views: 

    84
  • Downloads: 

    0
Keywords: 
Abstract: 

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 84

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

MIRZA MAHDI | BAHERNIK Z.

Issue Info: 
  • Year: 

    2002
  • Volume: 

    -
  • Issue: 

    13
  • Pages: 

    69-79
Measures: 
  • Citations: 

    0
  • Views: 

    711
  • Downloads: 

    0
Abstract: 

The seeds of cultivated Trachyspermum copticum L. Link collected in autumn from Research institute of Forests and Rangelands field and extracted by water distillation. The average of humidity was 3.8%. Analyses of essential oil were done by GC/MS which were resulted to identify 9 compounds which contains 100% of oil. Among the identified constituents, p- cymene (32.4%), g- terpinene (27.8%) and b- Pinene (1%) were the major constituents. The contents of phenolic compounds were less than those were reported by other scientists in different countries. It considers the soil ingredients, conditions and the methods of extraction were important on the essential oil contents.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 711

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

NASIRI MOHSEN

Issue Info: 
  • Year: 

    2000
  • Volume: 

    -
  • Issue: 

    2
  • Pages: 

    101-125
Measures: 
  • Citations: 

    1
  • Views: 

    832
  • Downloads: 

    0
Keywords: 
Abstract: 

Jojoba is considered as a valuable crop species regarding its tolerance to drought and soil salinity as well as its economical importance as an industrial crop. This species is used on soil conservation activities, against desertification, as an ornamental and landscaping plant and in some extend also can be considered as a nutritional plant. Seeds of Jojoba contain 50-60% liquid wax which is used in electronic, medicine, nutrition and cosmetic industries.The result of this experiment showed that application of 70% ethanol for 5 sec followed by 1% (w/v) benomyl for 30 min and 1% (v/v)sodium hypochlorite containing 1-2 drops of liquid detergent for 15 min caused the highest seed surface sterilizing efficiency.The highest germination rates (90%) were obtained when the seeds were incubated in a 27°C dark germinator for 5-13 days.There was significant differences (P < 1%) among seed germination rates. In this experiment seed germination was examined as most convenience and low cost method of Jojoba propagation.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 832

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button