Link prediction is one of the most important and challenging tasks in complex network analysis, which aims to predict the likelihood of the existence of missing links based on the known information in the network. As critical topological properties in the network, node degree and clustering coefficient are well-suited for describing the tightness of connection between nodes. The node importance can affect the possibility of link existence to a certain extent. By analyzing the impact of different centrality on links, which concluded that the degree centrality and proximity centrality have the greatest influence on link prediction. So, a link prediction algorithm combines node importance and attribute, called DCCLP, is proposed in this paper. In the training phase of the DCCLP algorithm, the maximized AUC indicator in the training set as the objective, and the optimal parameters are estimated by utilizing the White Shark Optimization algorithm. Then the prediction accuracy of the DCCLP algorithm is evaluated in the test set. By experimenting on twenty-one networks with different scales, and comparing with existing algorithms, the experimental results show that the effectiveness and feasibility of DCCLP algorithm, and further illustrate the importance of the degree centrality of node pairs and proximity centrality of nodes to improve the prediction accuracy of link prediction.